DocumentCode :
922113
Title :
Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)
Author :
Paaske, Erik
Volume :
20
Issue :
5
fYear :
1974
fDate :
9/1/1974 12:00:00 AM
Firstpage :
683
Lastpage :
689
Abstract :
A search procedure is developed to find good short binary 
convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distance 
either cannot achieve the maximum value or is equal to of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values of to be good. A number of short, optimum (in the sense of maximizing ), rate-2/3 and 3/4 codes found by the search procedure are listed.
convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distance either cannot achieve the maximum value or is equal to of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values of to be good. A number of short, optimum (in the sense of maximizing ), rate-2/3 and 3/4 codes found by the search procedure are listed.Keywords :
Convolutional codes; Binary codes; Concatenated codes; Convolutional codes; Error correction codes; Information theory; Notice of Violation; Polynomials; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1974.1055264
Filename :
1055264
Link To Document :
