Publication: Maximum distance separable convolutional codes
Maximum distance separable convolutional codes
Date
Date
Date
Citations
Rosenthal, J., & Smarandache, R. (1999). Maximum distance separable convolutional codes. Applicable Algebra in Engineering, Communication and Computing, 10(1), 15–32. https://doi.org/10.1007/s002000050120
Abstract
Abstract
Abstract
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 more than n. In this paper we generalize this concept to the class of convolutional codes of a fixed rate k/n and a fixed code degree δ. In order to achieve this result we will 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
Metrics
Views
Additional indexing
Creators (Authors)
Journal/Series Title
Journal/Series Title
Journal/Series Title
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Keywords
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Metrics
Views
Citations
Rosenthal, J., & Smarandache, R. (1999). Maximum distance separable convolutional codes. Applicable Algebra in Engineering, Communication and Computing, 10(1), 15–32. https://doi.org/10.1007/s002000050120