DocumentCode
907698
Title
Uniform codes
Author
Massey, James L.
Volume
12
Issue
2
fYear
1966
fDate
4/1/1966 12:00:00 AM
Firstpage
132
Lastpage
134
Abstract
For any prime-power
, it is shown that there exist
-ary convolutional codes with the equidistance property that every code word is at the same distance from all code words disagreeing in the information digits to be decoded. These codes are called "uniform codes" and it is shown that they can be encoded in a very simple manner. The block codes most similar to uniform codes are the maximal-length codes which also have the equidistance property. It is shown that the error performance of these classes of codes is nearly identical but that the uniform codes have simpler encoding circuits. This latter fact is of importance in space applications, which is the most likely use for these codes.
, it is shown that there exist
-ary convolutional codes with the equidistance property that every code word is at the same distance from all code words disagreeing in the information digits to be decoded. These codes are called "uniform codes" and it is shown that they can be encoded in a very simple manner. The block codes most similar to uniform codes are the maximal-length codes which also have the equidistance property. It is shown that the error performance of these classes of codes is nearly identical but that the uniform codes have simpler encoding circuits. This latter fact is of importance in space applications, which is the most likely use for these codes.Keywords
Convolutional codes; Block codes; Contracts; Convolutional codes; Decoding; Digital circuits; Digital communication; Encoding; Galois fields; Space vehicles; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1966.1053886
Filename
1053886
Link To Document