Minimal Trellises for Block Codes

IEEE Transactions on Information Theory

Volumn 34, Issue 5, 1988, Pages 1049-1053

  Muder, Douglas J ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; MAXIMUM DISTANCE SEPARABLE CODES; MINIMAL TRELLISES; PERFECT CODES; TRELLIS CODING;

CODES, SYMBOLIC;

EID: 0024078703     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.21228     Document Type: Article

References (6)

1. G. David Forney, Jr., “ Coset codes—Part I: Geometry and classification,” IEEE Trans. Inform. Theory, vol. 34, pp. 1123–1151, Sept. 1988, Part II.
2. —, “Coset codes—Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988, Part II.
3. —, “Coset codes III: Ternary codes, lattices, and trellis codes,” preprint.
4. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
5. J. L. Massey, “Foundation and methods of channel encoding,” in Proc. Int. Conf. Information Theory and Systems, NTG-Fachberichte, Berlin, 1978.
6. J. K. Wolf, “Efficient maximum likelihood decoding of linear block code using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.