Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.
- 1 July 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (4), 577-579
- https://doi.org/10.1109/tit.1973.1055028
Abstract
In the above paper,^1Bahl 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.Keywords
This publication has 2 references indexed in Scilit:
- An efficient algorithm for computing free distance (Corresp.)IEEE Transactions on Information Theory, 1972
- Inverses of Linear Sequential CircuitsIEEE Transactions on Computers, 1968