Classification of Extremal and s-Extremal Binary Self-Dual Codes of Length 38

DOI10.1109/TIT.2011.2177809MaRDI QIDQ5272008zbMATH OpenFDO

Authors Carlos Aguilar-Melchor, Jon-Lark Kim, Lin Sok, Philippe Gaborit, Patrick Solé

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: In this paper we classify all extremal and $s$-extremal binary self-dual codes of length 38. There are exactly 2744 extremal $[38,19,8]$ self-dual codes, two $s$-extremal $[38,19,6]$ codes, and 1730 $s$-extremal $[38,19,8]$ codes. We obtain our results from the use of a recursive algorithm used in the recent classification of all extremal self-dual codes of length 36, and from a generalization of this recursive algorithm for the shadow. The classification of $s$-extremal $[38,19,6]$ codes permits to achieve the classification of all $s$-extremal codes with d=6.

Cited in

(9)

• Optimal binary codes and binary construction of quantum codes
• Self-dual codes and orthogonal matrices over large finite fields
• Classification of ternary extremal self-dual codes of length 28
• On the existence of s-extremal singly even self-dual codes
• A projection decoding of a binary extremal self-dual code of length 40
• On the classification of the codes obtained by subtracting from some ternary extremal self-dual codes
• The binary extremal self-dual codes of lengths 38 and 40
• Classification of binary self-dual \([48,24,10]\) codes with an automorphism of odd prime order
• Homomorphisms from the Coxeter graph

This page was built for publication: Classification of Extremal and $s$-Extremal Binary Self-Dual Codes of Length 38

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