Loading [MathJax]/extensions/MathZoom.js
Low Complexity Tail-Biting Trellises for Some Extremal Self-Dual Codes
Olocco, Grégory ; Otmani, Ayoub
HAL, hal-00921851 / Harvested from HAL
Text on HAL
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.
Publié le : 2002-09-08
Classification:  necklace factor graph,  self-dual codes,  tail-biting trellises,  necklace factor graph.,  [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT],  [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 
@article{hal-00921851,
     author = {Olocco, Gr\'egory and Otmani, Ayoub},
     title = {Low Complexity Tail-Biting Trellises for Some Extremal Self-Dual Codes},
     journal = {HAL},
     volume = {2002},
     number = {0},
     year = {2002},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00921851}
}

Olocco, Grégory; Otmani, Ayoub. Low Complexity Tail-Biting Trellises for Some Extremal Self-Dual Codes. HAL, Tome 2002 (2002) no. 0, . http://gdmltest.u-ga.fr/item/hal-00921851/