DocumentCode :
929823
Title :
Some optimal partial-unit-memory codes (Corresp.)
Author :
Lauer, Gregory S.
Volume :
25
Issue :
2
fYear :
1979
fDate :
3/1/1979 12:00:00 AM
Firstpage :
240
Lastpage :
243
Abstract :
A new class of time-invariant binary convolutional codes is defined, called partial-unit-memory codes. These codes are optimal in the sense of having maximum free distance for given values of 
(the number of encoder inputs), and 
(the number of encoder memory cells). New optimal codes are given for rates 
with 
, whenever such a code is better than previously known An infinite class of optimal partial-unit-memory codes is also constructed based on equidistant block codes.
(the number of encoder inputs), and (the number of encoder memory cells). New optimal codes are given for rates with , whenever such a code is better than previously known An infinite class of optimal partial-unit-memory codes is also constructed based on equidistant block codes.Keywords :
Convolutional codes; Block codes; Code standards; Convolutional codes; Decoding; Delay; Encoding; Equations; Hamming weight; State-space methods; Terminology;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1979.1056014
Filename :
1056014
Link To Document :
