DocumentCode
916480
Title
Rate 1/2 convolutional codes with complementary generators
Author
Bahl, Lalit R. ; Jelinek, Frederick
Volume
17
Issue
6
fYear
1971
fDate
11/1/1971 12:00:00 AM
Firstpage
718
Lastpage
727
Abstract
The structure of a class of rate 
convolutional codes called complementary codes is investigated. Of special interest are properties that permit a simplified evaluation of free distance. Methods for finding the codes with largest free distance in this class are obtained. A synthesis procedure and a search procedure that result in good codes up to constraint lengths of 24 are described. The free and minimum distances of the best complementary codes are compared with the best known bounds and with the distances of other known codes.
convolutional codes called complementary codes is investigated. Of special interest are properties that permit a simplified evaluation of free distance. Methods for finding the codes with largest free distance in this class are obtained. A synthesis procedure and a search procedure that result in good codes up to constraint lengths of 24 are described. The free and minimum distances of the best complementary codes are compared with the best known bounds and with the distances of other known codes.Keywords
Convolutional codes; Convolutional codes; Demodulation; Error correction; Error correction codes; Hamming weight; Helium; Iterative decoding; Jacobian matrices; NASA; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1971.1054712
Filename
1054712
Link To Document