Robustly Optimal Rate One-Half Binary Convolutional Codes

IEEE Transactions on Information Theory

Volumn 21, Issue 4, 1975, Pages 464-468

  Johannesson, Rolf ^a  

^a LUND INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CONVOLUTIONAL CODES; SEQUENTIAL DECODING;

CODES, SYMBOLIC;

EID: 0016534174     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1975.1055397     Document Type: Article

References (10)

1. J. L. Massey and D. J. Costello, Jr., “Nonsystematic convolutional codes for sequential decoding in space applications,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 806-813, Oct. 1971.
2. D J. Costello, Jr., “A construction technique for random-error-correcting convolutional codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-15, pp. 631–636, Sept. 1969.
3. J. L. Massey, Threshold Decoding. Cambridge, Mass.: M.I.T. Press, 1963.
4. A. J. Viterbi, “Convolutional codes and their performance in communication systems,” IEEE Trans. Commun. Technol., vol. COM-19, pp. 751–772, Oct, 1971.
5. K. J. Larsen, “Short convolutional codes with maximal free distance for rates ½, ⅓, and ¼,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-19, pp. 371–372, May 1973.
6. J. J. Bussgang, “Some properties of binary convolutional code generators,” IEEE Trans. Inform. Theory, vol. IT-11, pp. 90–100, Jan. 1965.
7. G. D. Forney, Jr., “Use of a sequential decoder to analyze convolutional code structure,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-16, pp. 793-795, Nov. 1970.
8. S. Lin and H. Lyne, “Some results on binary convolutional code generators,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-13, pp. 134–139, Jan. 1967.
9. L. R. Bahl and F. Jelinek, “Rate ½ convolutional codes with complementary generators,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 718–727. Nov. 1971.
10. F. Jelinek, “A fast sequential decoding algorithm using a stack,” IBM J. Res. Dev., vol. 13, pp. 675–685, Nov. 1969.