Maximum distance separable convolutional codes
From MaRDI portal
A maximum distance separable (MDS) block code is a linear code whose distance is maximal among all linear block codes of rate \(k/n\). It is well known that MDS block codes do exist if the field size is greater than \(n\). In this paper this concept is generalized to the class of convolutional codes of a fixed rate \(k/n\) and a fixed code degree \(\delta\). In order to achieve this result the authors introduce a natural upper bound for the free distance generalizing the Singleton bound. The main result of the paper shows that this upper bound can be achieved in all cases if one allows sufficiently many field elements.
Recommendations
Cited in
(64)- AG codes and AG quantum codes from the GGS curve
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Feedback equivalence of convolutional codes over finite rings
- AG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves
- On the existence and construction of maximum distance profile convolutional codes
- Convolutional codes: techniques of construction
- Peterson-Gorenstein-Zierler algorithm for differential convolutional codes
- \(1/n\) turbo codes from linear system point of view
- Systematic maximum sum rank codes
- Cyclic distances of idempotent convolutional codes
- A new rank metric for convolutional codes
- Block Toeplitz matrices for burst-correcting convolutional codes
- A novel maximum distance separable code to generate universal identifiers
- Necessary field size and probability for MDP and complete MDP convolutional codes
- Nonbinary quantum convolutional codes derived from negacyclic codes
- On doubly-cyclic convolutional codes
- A new class of superregular matrices and MDP convolutional codes
- On negacyclic MDS-convolutional codes
- Convolutional codes with maximum distance profile
- On the weight distribution of convolutional codes
- Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
- Superregular matrices and applications to convolutional codes
- Parallel concatenated convolutional codes from linear systems theory viewpoint
- Constructing strongly-MDS convolutional codes with maximum distance profile
- ON THE ALGEBRAIC PARAMETERS OF CONVOLUTIONAL CODES WITH CYCLIC STRUCTURE
- From 1D convolutional codes to 2D convolutional codes of rate 1/n
- Input-state-output representation of convolutional product codes
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes
- Strongly-MDS convolutional codes
- Note on maximal distance separable codes
- Nonbinary convolutional codes derived from group character codes
- A note on maximum distance separable (optimal) codes (Corresp.)
- On maximum-distance-separable convolutional codes (Corresp.)
- A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices
- Constructions of MDS-convolutional codes
- On optimal extended row distance profile
- Algebraic geometry and convolutional codes
- On the left primeness of some polynomial matrices with applications to convolutional codes
- On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
- Asymptotically good convolutional codes
- Complete MDP convolutional codes
- A CLASS OF ONE-DIMENSIONAL MDS CONVOLUTIONAL CODES
- Families of convolutional codes over finite fields: a survey
- Constructions of MDS convolutional codes using superregular matrices
- Codes in the sum-rank metric: fundamentals and applications
- On optimal constacyclic codes
- Weighted Reed–Solomon convolutional codes
- Criteria for the construction of MDS convolutional codes with good column distances
- On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)
- A new construction of an MDS convolutional code of rate \(1/2\)
- Generalized column weights and equivalences of convolutional codes
- On the construction of MRD convolutional codes
- Classical convolutional GRS codes and applications to quantum convolutional codes
- A new method for erasure decoding of convolutional codes
- Convolutional Goppa codes defined on fibrations
- New constructions of MDP convolutional codes with memory 1 for k=2,3
- A polynomial-based key distribution approach for wireless sensor networks
- Construction of observable and MDP convolutional codes with good decodable properties by ISO representations
- Output feedback transformations for preserving observability and structural decodability in convolutional codes
- On cyclotomic cosets and code constructions
- On superregular matrices and MDP convolutional codes
- Linear system modelization of concatenated block and convolutional codes
- Classification of convolutional codes
- A first approximation of concatenated convolutional codes from linear systems theory viewpoint
This page was built for publication: Maximum distance separable convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304763)
