Title :
Strongly-MDS convolutional codes
Author :
Gluesing-Luerssen, Heide ; Rosenthal, Joachim ; Smarandache, Roxana
Author_Institution :
Dept. of Math., Univ. of Groningen, Netherlands
Abstract :
Maximum-distance separable (MDS) convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper, a class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earliest possible instant. Such codes are called strongly-MDS convolutional codes. They also have a maximum or near-maximum distance profile. The extended row distances of these codes will also be discussed briefly.
Keywords :
convolutional codes; error correction codes; maximum principle; MDS; convolutional code; extended row distance; generalized Singleton bound; maximum-distance separable code; near-maximum distance profile; Block codes; Books; Building materials; Concrete; Convolutional codes; Decoding; Information theory; Mathematics; Upper bound; Viterbi algorithm; Column distances; convolutional codes; extended row distances; maximum-distance separable (MDS) codes; superregular matrices; unit memory codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2005.862100
