DocumentCode
919524
Title
Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
Author
Larsen, Knud J.
Volume
19
Issue
3
fYear
1973
fDate
5/1/1973 12:00:00 AM
Firstpage
371
Lastpage
372
Abstract
This paper gives a tabulation of binary convolutional codes with maximum free distance for rates
, and
for all constraint lengths (measured in information digits)
up to and including
. These codes should be of practical interest in connection with Viterbi decoders.
, and
for all constraint lengths (measured in information digits)
up to and including
. These codes should be of practical interest in connection with Viterbi decoders.Keywords
Convolutional codes; Binary sequences; Block codes; Convolutional codes; Decoding; Length measurement; Memoryless systems; Probability distribution; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1973.1055014
Filename
1055014
Link To Document