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

  • Aguilar-Melchor, Carlos
  • Gaborit, Philippe
  • Kim, Jon-Lark
  • Sok, Lin
  • Sole, Patrick
Citations

WEB OF SCIENCE

13
Citations

SCOPUS

13

초록

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.

키워드

Classificationextremalrecursive constructionself-dual codess-extremalshadowLATTICES
제목
Classification of Extremal and s-Extremal Binary Self-Dual Codes of Length 38
저자
Aguilar-Melchor, CarlosGaborit, PhilippeKim, Jon-LarkSok, LinSole, Patrick
DOI
10.1109/TIT.2011.2177809
발행일
2012-04
유형
Article
저널명
IEEE Transactions on Information Theory
58
4
페이지
2253 ~ 2262