Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)
Erik Paaske · IEEE Transactions on Information Theory · 1974
A search procedure is developed to find good short binary(N,N - 1)convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distanced_{free}either cannot achieve the maximum value or is equal tod_{free}of some code in the remaining set. Farther, the search among the remaining codes is started in a subset in which we expect the possibility of finding codes with large values ofd_{free}to be good. A number of short, optimum (in the sense of maximizingd_{free}), rate-2/3 and 3/4 codes found by the search procedure are listed.
Cited by 84 works. doi:10.1109/tit.1974.1055264
Authors
References
- Convolutional codes I: Algebraic structure
- Inverses of Linear Sequential Circuits
- An efficient algorithm for computing free distance (Corresp.)
- Convolutional codes II. Maximum-likelihood decoding
- Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
- Minimum-distance bounds for binary linear codes
- Construction of convolutional codes for sequential decoding
- Structural analysis of convolutional codes via dual codes
- Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.