DocumentCode :
926511
Title :
Some rate 1/3 and 1/4 binary convolutional codes with an optimum distance profile (Corresp.)
Author :
Johannesson, Rolf
Volume :
23
Issue :
2
fYear :
1977
fDate :
3/1/1977 12:00:00 AM
Firstpage :
281
Lastpage :
283
Abstract :
A tabulation of binary systematic convolutional codes with an optimum distance profile for rates 
and 
is given. A number of short rate binary nonsystematic convolutional codes are listed. These latter codes are simultaneously optimal for the following distance measures: distance profile, minimum distance, and free distance; they appear attractive for use with Viterbi decoders. Comparisons with previously known codes are made.
and is given. A number of short rate binary nonsystematic convolutional codes are listed. These latter codes are simultaneously optimal for the following distance measures: distance profile, minimum distance, and free distance; they appear attractive for use with Viterbi decoders. Comparisons with previously known codes are made.Keywords :
Convolutional codes; Automata; Convolutional codes; Decoding; NASA; Navigation; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1977.1055687
Filename :
1055687
Link To Document :
