Binary doubly-even self-dual codes of length 72 with large automorphism groups

Dean Crnković; Sanja Rukavina; Loredana Simčić

Vol. 18 No. 2 (2013)

Regular Articles

Binary doubly-even self-dual codes of length 72 with large automorphism groups

Published 2013-04-28

Dean Crnković
Sanja Rukavina
Loredana Simčić

Dean Crnković
University of Rijeka

Sanja Rukavina
University of Rijeka

Loredana Simčić
University of Rijeka

Submission of an original manuscript to the Mathematical Communications will be taken to mean that it represents original work not previously published, that it is not being considered elsewhere for publication; and, if accepted for publication, it will be published in print and online form and it will not be published elsewhere in the same form, for commercial purposes, in any language, without the consent of the publisher. The journal takes the stance that the publication of scholarly research is meant to disseminate knowledge and, in a not-for-profit regime, benefits neither publisher nor author financially. It sees itself as having an obligation to its authors and to society to make content available online now that the technology allows for such a possibility.

Abstract

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 codes
have large automorphism groups, they are suitable for permutation decoding. Therefore we study
PD-sets of the obtained codes. We also discuss error-correcting capability of the obtained codes
by majority logic decoding. Further, we describe a construction of a strongly regular graph
with parameters (126,25,8,4) from a binary [35,8,4] code related to a derived 2-(35,17,16) design.

Keywords

self-dual code, Hadamard matrix, strongly regular graph

PDF

Supplementary File(s)

LaTeX source