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 (n_{o},k_{o}) convolutional codes with unit memory always achieve the largest free distance among all codes of the same rate k_{o}/n_{o} and same number 2^{Mk_{o}} of encoder states, where M 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 k_{o} and n_{o} relatively prime, for all Mk_{o} \\leq 6 and for R = l/2, 1/3, 1/4, 2/3 . 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 :
بازگشت