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

Grégory Olocco (1) , Ayoub Otmani (2)

1 LRI - Laboratoire de Recherche en Informatique
2 LACO - Laboratoire d'Arithmétique, de Calcul formel et d'Optimisation

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 particular family of cyclic Tanner graphs called necklace factor graphs.

Mots clés: self-dual codes; tail-biting trellises; necklace factor graph.; necklace factor graph

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Grégory Olocco, Ayoub Otmani. Low Complexity Tail-Biting Trellises for Some Extremal Self-Dual Codes. Eighth Algebraic and Combinatorial Coding Theory (ACCT VIII), Sep 2002, St.Petersburg, Russia. pp.214-218. ⟨hal-00921851⟩