DocumentCode
925174
Title
Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)
Author
Lee, Lin-nan
Volume
22
Issue
3
fYear
1976
fDate
5/1/1976 12:00:00 AM
Firstpage
349
Lastpage
352
Abstract
It is shown that 
convolutional codes with unit memory always achieve the largest free distance among all codes of the same rate 
and same number 
of encoder states, where 
is the encoder memory. A unit-memory code with maximal free distance is given at each place where this free distance exceeds that of the best code with 
and 
relatively prime, for all 
and for 
. It is shown that the unit-memory codes are byte oriented in such a way as to be attractive for use in concatenated coding systems.
convolutional codes with unit memory always achieve the largest free distance among all codes of the same rate and same number of encoder states, where is the encoder memory. A unit-memory code with maximal free distance is given at each place where this free distance exceeds that of the best code with and relatively prime, for all and for . It is shown that the unit-memory codes are byte oriented in such a way as to be attractive for use in concatenated coding systems.Keywords
Convolutional codes; Circuits; Concatenated codes; Convolutional codes; Decoding; Delay; Encoding; Equations; Length measurement; Memory management; NASA;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1976.1055557
Filename
1055557
Link To Document