## Low Complexity Tail-Biting Trellises for Some Extremal Self-Dual Codes

*Olocco , Grégory*;

*Otmani , Ayoub*;

- Publisher: HAL CCSD
- Subject: necklace factor graph | tail-biting trellises | [ INFO.INFO-IT ] Computer Science [cs]/Information Theory [cs.IT] | necklace factor graph. | [ MATH.MATH-IT ] Mathematics [math]/Information Theory [math.IT] | self-dual codes

International audience; We obtain low complexity tail-biting trellises for some extremal self-dual codes for various lengths and fields such as the [12,6,6] ternary Golay code and a [24,12,8] Hermitian self-dual code over GF(4). These codes are obtained from a particula... View more

- References (4)
[1] A.R. Carlderbank, G.D. Forney, A. Vardy, Minimal Tail-Biting Trellis: The Golay Code and More, IEEE Transactions on Information Theory, Vol. 45, No. 5, July 1999, pp. 1435-1455.

[2] J.C. Carlach, C. Vervoux, A New Family of Block Turbo-Codes, AAECC-13, 1999, pp. 15-16.

[3] E. Cadic, J.C. Carlach, G. Olocco, A. Otmani and J.P. Tillich, Low Complexity TailBiting Trellises of Extremal Self-Dual Codes of Length 24, 32 and 40 over GF (2) and Z4, AAECC14, 2001.

[4] G.D. Forney, Jr., Codes on Graph: Normal Realizations, IEEE Transactions on Information Theory, Vol. 47, pp. 520-548, Feb. 2001.

- Metrics No metrics available

Share - Bookmark

- Download from
- INRIA a CCSD electronic archive server via INRIA a CCSD electronic archive server (Conference object, 2002)

- Cite this publication