Complete MDP convolutional codes
From MaRDI portal
Abstract: Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond that the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. The first main result of this paper is to show the existence and genericity of complete MDP convolutional codes for all code parameters. The second main contribution is the presentation of two concrete construction techniques to obtain complete MDP convolutional codes. These constructions work for all code parameters but require that the size of the underlying base field is (sufficiently) large.
Recommendations
- Necessary field size and probability for MDP and complete MDP convolutional codes
- On the existence and construction of maximum distance profile convolutional codes
- Constructing strongly-MDS convolutional codes with maximum distance profile
- MDS convolutional codes
- Convolutional codes over finite chain rings, MDP codes and their characterization
Cites work
- A new class of superregular matrices and MDP convolutional codes
- Constructing strongly-MDS convolutional codes with maximum distance profile
- Constructions of MDS-convolutional codes
- Convolutional codes with maximum distance profile
- Decoding of Convolutional Codes Over the Erasure Channel
- scientific article; zbMATH DE number 1714647 (Why is no real title available?)
- Maximum distance separable convolutional codes
- On superregular matrices and MDP convolutional codes
- Strongly-MDS convolutional codes
- Superregular matrices and applications to convolutional codes
- The Existence of Strongly MDS Convolutional Codes
- The mathematics of networks of linear systems
Cited in
(10)- On the existence and construction of maximum distance profile convolutional codes
- Systematic maximum sum rank codes
- Necessary field size and probability for MDP and complete MDP convolutional codes
- On the left primeness of some polynomial matrices with applications to convolutional codes
- Constructions of MDS convolutional codes using superregular matrices
- Noncatastrophic convolutional codes over a finite ring
- Convolutional codes over finite chain rings, MDP codes and their characterization
- A decoding algorithm for 2D convolutional codes over the erasure channel
- A new method for erasure decoding of convolutional codes
- Construction of observable and MDP convolutional codes with good decodable properties by ISO representations
This page was built for publication: Complete MDP convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383885)
