Extremal self-dual codes of length 64 through neighbors and covering radii

Naoki Chigira; Masaaki Harada; Masaaki Kitazume

doi:10.1007/s10623-006-9018-5

Extremal self-dual codes of length 64 through neighbors and covering radii

Naoki Chigira, Masaaki Harada, Masaaki Kitazume

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

14 Citations (Scopus)

Abstract

We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.

Original language	English
Pages (from-to)	93-101
Number of pages	9
Journal	Designs, Codes, and Cryptography
Volume	42
Issue number	1
DOIs	https://doi.org/10.1007/s10623-006-9018-5
Publication status	Published - 2007 Jan
Externally published	Yes

Keywords

Covering radius
Extremal self-dual code
Neighbor

ASJC Scopus subject areas

Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s10623-006-9018-5

Cite this

@article{ab201b5a00504f33bdd9c82387bf52d4,

title = "Extremal self-dual codes of length 64 through neighbors and covering radii",

abstract = "We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.",

keywords = "Covering radius, Extremal self-dual code, Neighbor",

author = "Naoki Chigira and Masaaki Harada and Masaaki Kitazume",

year = "2007",

month = jan,

doi = "10.1007/s10623-006-9018-5",

language = "English",

volume = "42",

pages = "93--101",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Extremal self-dual codes of length 64 through neighbors and covering radii

AU - Chigira, Naoki

AU - Harada, Masaaki

AU - Kitazume, Masaaki

PY - 2007/1

Y1 - 2007/1

N2 - We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.

AB - We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.

KW - Covering radius

KW - Extremal self-dual code

KW - Neighbor

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

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

U2 - 10.1007/s10623-006-9018-5

DO - 10.1007/s10623-006-9018-5

M3 - Article

AN - SCOPUS:33845380028

VL - 42

SP - 93

EP - 101

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 1

ER -

Extremal self-dual codes of length 64 through neighbors and covering radii

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this