The binary extremal self-dual codes of lengths 38 and 40

Hyun Jin Kim

doi:10.1007/s10623-011-9534-9

The binary extremal self-dual codes of lengths 38 and 40

Hyun Jin Kim

University College

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

We classify the extremal self-dual codes of lengths 38 or 40 having an automorphism of order 3 with six independent 3-cycles, 10 independent 3-cycles, or 12 independent 3-cycles. In this way we complete the classification of binary extremal self-dual codes of length up to 48 having automorphism of odd prime order.

Original language	English
Pages (from-to)	43-57
Number of pages	15
Journal	Designs, Codes, and Cryptography
Volume	63
Issue number	1
DOIs	https://doi.org/10.1007/s10623-011-9534-9
Publication status	Published - 2012 Apr

Bibliographical note

Funding Information:
Acknowledgments The author would like to thank the anonymous referees for their helpful comments and suggestions. This work was supported by Priority Research Centers Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2010-0028298).

All Science Journal Classification (ASJC) codes

Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s10623-011-9534-9

Cite this

@article{2e310568c29a4b14a69f22d85feae666,

title = "The binary extremal self-dual codes of lengths 38 and 40",

abstract = "We classify the extremal self-dual codes of lengths 38 or 40 having an automorphism of order 3 with six independent 3-cycles, 10 independent 3-cycles, or 12 independent 3-cycles. In this way we complete the classification of binary extremal self-dual codes of length up to 48 having automorphism of odd prime order.",

author = "Kim, {Hyun Jin}",

note = "Funding Information: Acknowledgments The author would like to thank the anonymous referees for their helpful comments and suggestions. This work was supported by Priority Research Centers Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2010-0028298).",

year = "2012",

month = apr,

doi = "10.1007/s10623-011-9534-9",

language = "English",

volume = "63",

pages = "43--57",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - The binary extremal self-dual codes of lengths 38 and 40

AU - Kim, Hyun Jin

N1 - Funding Information: Acknowledgments The author would like to thank the anonymous referees for their helpful comments and suggestions. This work was supported by Priority Research Centers Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2010-0028298).

PY - 2012/4

Y1 - 2012/4

N2 - We classify the extremal self-dual codes of lengths 38 or 40 having an automorphism of order 3 with six independent 3-cycles, 10 independent 3-cycles, or 12 independent 3-cycles. In this way we complete the classification of binary extremal self-dual codes of length up to 48 having automorphism of odd prime order.

AB - We classify the extremal self-dual codes of lengths 38 or 40 having an automorphism of order 3 with six independent 3-cycles, 10 independent 3-cycles, or 12 independent 3-cycles. In this way we complete the classification of binary extremal self-dual codes of length up to 48 having automorphism of odd prime order.

UR - http://www.scopus.com/inward/record.url?scp=84905373251&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84905373251&partnerID=8YFLogxK

U2 - 10.1007/s10623-011-9534-9

DO - 10.1007/s10623-011-9534-9

M3 - Article

AN - SCOPUS:84905373251

SN - 0925-1022

VL - 63

SP - 43

EP - 57

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 1

ER -

The binary extremal self-dual codes of lengths 38 and 40

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this