Maximum distance separable convolutional codes (Q1304763)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum distance separable convolutional codes |
scientific article; zbMATH DE number 1340314
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum distance separable convolutional codes |
scientific article; zbMATH DE number 1340314 |
Statements
Maximum distance separable convolutional codes (English)
0 references
29 August 2000
0 references
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.
0 references
convolutional codes
0 references
MDS block codes
0 references