Tight bounds on the minimum average weight per branch for rate (N - 1)/N convolutional codes

IEEE Transactions on Information Theory

Volumn 43, Issue 4, 1997, Pages 1301-1305

  Hole, Marianne Fjelltveit ^b   Hole, Kjell Jørgen ^a,c  

^a IEEE

^b Nera Networks AS   (Norway)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

Asymptotically catastrophic convolutional codes; Minimum average weight per branch

Indexed keywords

BINARY SEQUENCES; BIT ERROR RATE; DECODING; ERROR ANALYSIS; MATRIX ALGEBRA; PROBABILITY; VECTORS;

STATE DIAGRAM;

CONVOLUTIONAL CODES;

EID: 0031188041     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605599     Document Type: Article

References (9)

1. G. K. Huth and C. L. Weber, "Minimum weight convolutional codewords of finite length," IEEE Trans. Inform. Theory, vol. IT-22, pp. 243-246, Mar. 1976.
2. F. Hemmati and D. J. Costello Jr., "Asymptotically catastrophic convolutional codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 298-304, May 1980.
3. A. D. Wyner and R. B. Ash, "Analysis of recurrent codes," IEEE Trans. Inform. Theory, vol. IT-9, pp. 143-156, 1963.
4. Ø. Ytrehus, "A note on high rate binary convolutional codes," Dep. Informatics, Univ. of Bergen, Bergen, Norway, Tech. Rep. 68, Aug. 1992.
5. _, "Ascetic convolutional codes," in Proc. 33rd Allerton Conf. on Communication, Control, and Computing, Oct. 1995, pp. 382-390.
6. G. D. Forney, Jr., "Convolutional codes I: Algebraic structure," IEEE Trans. Inform. Theory, vol. IT-16, pp. 720-738, Nov. 1970.
7. E. Paaske, "Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4," IEEE Trans. Inform. Theory, vol. IT-20, pp. 683-689, Sept. 1974.
8. G. D. Forney, Jr., "Structural analysis of convolutional codes via dual codes," IEEE Trans. Inform. Theory, vol. IT-19, pp. 512-518, July 1973.
9. R. M. Karp, "A characterization of the minimum cycle mean in a digraph," Discr. Math., vol. 23, pp. 309-311, 1978.