A note on asymptotically catastrophic convolutional codes of rate (n -1)/n

IEEE Transactions on Communications

Volumn 45, Issue 9, 1997, Pages 1014-1016

  Hole, Kjell Jørgen ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Asymptotically catastrophic convolutional codes

Indexed keywords

BOUNDARY CONDITIONS; MATRIX ALGEBRA; VECTORS;

ASYMPTOTICALLY CATASTROPHIC CONVOLUTIONAL CODES;

CONVOLUTIONAL CODES;

EID: 0031234156     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.623061     Document Type: Article

References (5)

1. F. Hemmati and D. J. Costello, Jr., "Asymptotically catastrophic convolutional codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 298-304, May 1980.
2. M. F. Hole and K. J. Hole, "Tight bounds on the minimum average
3. weight per branch for rate (n -1)/n convolutional codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1301-1305, July 1997.
4. Ø. Ytrehus, "A note on high rate binary convolutional codes," Tech. Rep. 68, Dep. Informatics, Univ. Bergen, Norway, Aug. 1992.
5. G. D. Forney, Jr., "Structural analysis of convolutional codes via dual codes," IEEE Trans. Inform. Theory, vol. IT-19, pp. 512-518, July 1973.