An efficient algorithm for computing free distance (Corresp.)
- 1 May 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 18 (3), 437-439
- https://doi.org/10.1109/tit.1972.1054821
Abstract
An efficient bidirectional search algorithm for computing the free distance of convolutional codes is described.Keywords
This publication has 6 references indexed in Scilit:
- Rate 1/2 convolutional codes with complementary generatorsIEEE Transactions on Information Theory, 1971
- Use of a sequential decoder to analyze convolutional code structure (Corresp.)IEEE Transactions on Information Theory, 1970
- Fast Sequential Decoding Algorithm Using a StackIBM Journal of Research and Development, 1969
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Scatter storage techniquesCommunications of the ACM, 1968
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967