DocumentCode
936101
Title
MDS convolutional codes
Author
Piret, Philippe ; Krol, Thijs
Volume
29
Issue
2
fYear
1983
fDate
3/1/1983 12:00:00 AM
Firstpage
224
Lastpage
232
Abstract
Maximum distance separable (MDS) convolutional codes are defined as the row space over 
of totally nonsingular polynomial matrices in the indeterminate 
. These codes may be used to transmit information on 
parallel channels when a temporary or even an infinite break can occur in some of these channels. Their algebraic properties are emphasized, and the relevant parameters are introduced. On this basis two decoding procedures are described. Both procedures correct arbitrarily long error sequences that may occur at the same time in some of the channels. Some specific constructions of MDS convolutional codes are presented.
of totally nonsingular polynomial matrices in the indeterminate . These codes may be used to transmit information on parallel channels when a temporary or even an infinite break can occur in some of these channels. Their algebraic properties are emphasized, and the relevant parameters are introduced. On this basis two decoding procedures are described. Both procedures correct arbitrarily long error sequences that may occur at the same time in some of the channels. Some specific constructions of MDS convolutional codes are presented.Keywords
Convolutional coding; Polynomial matrices; Convolutional codes; Decoding; Delay; Error correction; Error correction codes; Feedback; Hamming distance; Information theory; Laboratories; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1983.1056637
Filename
1056637
Link To Document