In the above paper, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">^1</tex> 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.
No takes yet. Share an insight, caveat, or question.
K.E. Larsen (1973) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: