Rate 1/2 convolutional codes with complementary generators
L.R. Bahl, F. Jelinek · IEEE Transactions on Information Theory · 1971
The structure of a class of rate\frac{1}{2}convolutional codes called complementary codes is investigated. Of special interest are properties that permit a simplified evaluation of free distance. Methods for finding the codes with largest free distance in this class are obtained. A synthesis procedure and a search procedure that result in good codes up to constraint lengths of 24 are described. The free and minimum distances of the best complementary codes are compared with the best known bounds and with the distances of other known codes.
Cited by 48 works. doi:10.1109/tit.1971.1054712
Authors
References
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Principles of Communication Engineering
- Inverses of Linear Sequential Circuits
- Generalized minimum distance decoding
- Construction of convolutional codes for sequential decoding
- On decoding iterated codes
- Random error and burst correction by iterated codes
- A construction technique for random-error-correcting convolutional codes
- Use of a sequential decoder to analyze convolutional code structure (Corresp.)
- Some results on binary convolutional code generators (Corresp.)