Construction of minimal tail-biting trellises

1998 Information Theory Workshop, ITW 1998

Volumn , Issue , 1998, Pages 72-74

  Kotter, R ^a   Vardy, A ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; CODES (SYMBOLS); INFORMATION THEORY; TRELLIS CODES;

CHARACTERISTIC MATRICES; LINEAR BLOCK CODE; LINEAR CODES; MINIMAL TAIL-BITING TRELLIS; SPACE SIZE; TAILBITING TRELLIS;

C (PROGRAMMING LANGUAGE);

EID: 84938834590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.1998.706441     Document Type: Conference Paper

References (5)

1. A.R. Calderbank, G.D. Forney, Jr., and A. Vardy, "Minimal tailbiting trellises: the Golay code and more," IEEE Trans. Inform. Theory, submitted for publication, August 1997.
2. R. Kotter and A. Vardy, "The theory of tail-biting trellises," manuscript in preparation, 1998.
3. F.R. Kschischang and V. Sorokine, "On the trellis structure of block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 1924-1937, November 1995.
4. A. Vardy, "Trellis structure of codes," to appear in the HANDBOOK OF CODINGTH EORYV,.S . Pless and W.C. Huffman (Editors), Amsterdam: Elsevier, 1998.
5. N. Wiberg, H.-A. Loeliger and R. Kotter, "Codes and iterative decoding on general graphs," Euro. Tkans. Telecommun., vol. 6, pp. 513-526, September 1995.