DocumentCode :
919682
Title :
Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.
Author :
Larsen, Knud J.
Volume :
19
Issue :
4
fYear :
1973
fDate :
7/1/1973 12:00:00 AM
Firstpage :
577
Lastpage :
579
Abstract :
In the above paper, 
Bahl et aL described a bidirectional search algorithm for computing the free distance of convolutional codes. There are some flaws in that algorithm. This correspondence contains a corrected version of the algorithm together with a proof that the corrected version always computes the free distance for noncatastrophic codes.
Bahl et aL described a bidirectional search algorithm for computing the free distance of convolutional codes. There are some flaws in that algorithm. This correspondence contains a corrected version of the algorithm together with a proof that the corrected version always computes the free distance for noncatastrophic codes.fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1973.1055028
Filename :
1055028
Link To Document :
