An efficient construction of self-dual codes

From MaRDI portal
Publication:5265562

DOI10.4134/BKMS.2015.52.3.915zbMATH Open1325.94154arXiv1201.5689OpenAlexW2962974904MaRDI QIDQ5265562FDOQ5265562

Yoonjin Lee, Jon-Lark Kim

Publication date: 28 July 2015

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Abstract: We complete the building-up construction for self-dual codes by resolving the open cases over GF(q) with qequiv3pmod4, and over and Galois rings GR(pm,r) with an odd prime p satisfying pequiv3pmod4 with r odd. We also extend the building-up construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we construct 945 new extremal self-dual ternary [32,16,9] codes, each of which has a trivial automorphism group. We also obtain many new self-dual codes over mathbbZ9 of lengths 12,16,20 all with minimum Hamming weight 6, which is the best possible minimum Hamming weight that free self-dual codes over of these lengths can attain. From the constructed codes over mathbbZ9, we reconstruct optimal Type I lattices of dimensions 12,16,20, and 24 using Construction A; this shows that our building-up construction can make a good contribution for finding optimal Type I lattices as well as self-dual codes. We also find new optimal self-dual [16,8,7] codes over GF(7) and new self-dual codes over GF(7) with the best known parameters [24,12,9].


Full work available at URL: https://arxiv.org/abs/1201.5689




Recommendations





Cited In (15)

Uses Software





This page was built for publication: An efficient construction of self-dual codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265562)