DocumentCode
923903
Title
An algebraic construction of rate
-ary codes; algebraic construction (Corresp.)
Author
Justesen, J.
Volume
21
Issue
5
fYear
1975
fDate
9/1/1975 12:00:00 AM
Firstpage
577
Lastpage
580
Abstract
If the constraint length of a convolutional code is defined suitably, it is an obvious upper bound on the free distance of the code, and it is sometimes possible to find codes that meet this bound. It is proved here that the length of a rate
-ary code with this property is at most
, and we construct a class of such codes with lengths greater than
.
-ary code with this property is at most
, and we construct a class of such codes with lengths greater than
.Keywords
Convolutional codes; Block codes; Convolutional codes; Polynomials;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1975.1055436
Filename
1055436
Link To Document