Superregular matrices and applications to convolutional codes
From MaRDI portal
Abstract: The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a times b, a larger than or equal to b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a-b+1 nonzero entries. Secondly, we make use of this result to construct convolutional codes that attain the maximum possible distance for some fixed parameters of the code, namely, the rate and the Forney indices. These results answer some open questions on distances and constructions of convolutional codes posted in the literature.
Recommendations
- On superregular matrices and MDP convolutional codes
- A new class of superregular matrices and MDP convolutional codes
- Constructions of MDS convolutional codes using superregular matrices
- A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
- From 1D convolutional codes to 2D convolutional codes of rate \(1/n\)
Cites work
- scientific article; zbMATH DE number 1235882 (Why is no real title available?)
- scientific article; zbMATH DE number 1284425 (Why is no real title available?)
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- A new class of superregular matrices and MDP convolutional codes
- Circular planar graphs and resistor networks
- Constructing strongly-MDS convolutional codes with maximum distance profile
- Constructions of MDS-convolutional codes
- Maximum distance separable convolutional codes
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- On MDS codes via Cauchy matrices
- On generator matrices of MDS codes (Corresp.)
- On superregular matrices and MDP convolutional codes
- Some extremal problems for strictly totally positive matrices
- Strongly-MDS convolutional codes
- Totally positive matrices
Cited in
(22)- Constructions of MDS convolutional codes using superregular matrices
- Erasure decoding of convolutional codes using first-order representations
- Weighted Reed–Solomon convolutional codes
- A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
- Series concatenation of 2D convolutional codes by means of input-state-output representations
- Serial concatenation of a block code and a 2D convolutional code
- Block Toeplitz matrices for burst-correcting convolutional codes
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- MDS 2D convolutional codes with optimal 1D horizontal projections
- A new class of superregular matrices and MDP convolutional codes
- Construction of systematic \((k+1,k)\) memory MDS sliding window codes over embedded fields
- Convolutional codes over finite chain rings, MDP codes and their characterization
- Constructing strongly-MDS convolutional codes with maximum distance profile
- On optimal extended row distance profile
- A new rank metric for convolutional codes
- Necessary field size and probability for MDP and complete MDP convolutional codes
- A decoding algorithm for 2D convolutional codes over the erasure channel
- \(1/n\) turbo codes from linear system point of view
- Systematic maximum sum rank codes
- On superregular matrices and MDP convolutional codes
- From 1D convolutional codes to 2D convolutional codes of rate \(1/n\)
- Complete MDP convolutional codes
This page was built for publication: Superregular matrices and applications to convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269520)
