DocumentCode
893229
Title
Some convolutional codes whose free distances are maximal
Author
Abdel-Ghaffar, Khaled A S
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
Volume
35
Issue
1
fYear
1989
fDate
1/1/1989 12:00:00 AM
Firstpage
188
Lastpage
191
Abstract
The free distance of a convolutional code of rate 1/n is bounded by n times the constant length of its encoder. Two classes of convolutional codes whose free distances meet this bound are studied. A technique of constructing convolutional codes that meet this bound for all sufficiently large n is given
Keywords
error correction codes; constant length; convolutional code; encoder; free distance; Convolutional codes; Hamming weight; Helium; Mathematics; Polynomials; Time factors; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.42192
Filename
42192
Link To Document