An efficient algorithm for computing free distance (Corresp.)
L.R. Bahl, C. D. Cullum, W. Frazer et al. · IEEE Transactions on Information Theory · 1972
An efficient bidirectional search algorithm for computing the free distance of convolutional codes is described.
Cited by 59 works. doi:10.1109/tit.1972.1054821
Authors
References
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Fast Sequential Decoding Algorithm Using a Stack
- Scatter storage techniques
- Scatter storage techniques
- An Appraisal of Some Shortest-Path Algorithms
- Construction of convolutional codes for sequential decoding
- Rate 1/2 convolutional codes with complementary generators
- Use of a sequential decoder to analyze convolutional code structure (Corresp.)