Binary doubly-even self-dual codes of length 72 with large automorphism groups
Crnković, Dean ; Rukavina, Sanja ; Simčić, Loredana
Mathematical Communications, Tome 18 (2013) no. 1, p. 297-308 / Harvested from Mathematical Communications
Text on Mathematical Communications
We study binary linear codes constructed from fifty-four Hadamard 2-(71,35,17) designs.The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codeshave large automorphism groups, they are suitable for permutation decoding. Therefore we studyPD-sets of the obtained codes. We also discuss error-correcting capability of the obtained codesby majority logic decoding. Further, we describe a construction of a strongly regular graphwith parameters (126,25,8,4) from a binary [35,8,4] code related to a derived 2-(35,17,16) design.
Publié le : 2013-11-12
Classification:  self-dual code; Hadamard matrix; strongly regular graph,  94B05; 05B20; 05B05; 05E30 
@article{mc98,
     author = {Crnkovi\'c, Dean and Rukavina, Sanja and Sim\v ci\'c, Loredana},
     title = {Binary doubly-even self-dual codes of length 72 with large automorphism groups},
     journal = {Mathematical Communications},
     volume = {18},
     number = {1},
     year = {2013},
     pages = { 297-308},
     language = {eng},
     url = {http://dml.mathdoc.fr/item/mc98}
}

Crnković, Dean; Rukavina, Sanja; Simčić, Loredana. Binary doubly-even self-dual codes of length 72 with large automorphism groups. Mathematical Communications, Tome 18 (2013) no. 1, pp.  297-308. http://gdmltest.u-ga.fr/item/mc98/