New quasi-cyclic codes from simplex codes

Eric Zhi Chen

doi:10.1109/TIT.2006.890727

New quasi-cyclic codes from simplex codes

Eric Zhi Chen

Forskningsoutput: Tidskriftsbidrag › Artikel › Peer review

23 Citeringar (Scopus)

Sammanfattning

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and 3-generator QC codes are studied, and many good, new QC codes are constructed from simplex codes. Some new binary QC codes or related codes, that improve the bounds on maximum minimum distance for binary linear codes are constructed. They are 5-generator QC [93 17 34] and [254,23, 102] codes, and related [96, 17, 361, [256, 23,104] codes.

Originalspråk	Engelska
Sidor (från-till)	1193-1196
Antal sidor	3
Tidskrift	IEEE Transactions on Information Theory
Volym	53
Nummer	3
DOI	https://doi.org/10.1109/TIT.2006.890727
Status	Publicerad - 2007

Nationell ämneskategori

Teknik (2)

Åtkomst av dokument

10.1109/TIT.2006.890727

Citera det här

@article{5bca0577e4b6485bbf01be3c7a323547,

title = "New quasi-cyclic codes from simplex codes",

abstract = "As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and 3-generator QC codes are studied, and many good, new QC codes are constructed from simplex codes. Some new binary QC codes or related codes, that improve the bounds on maximum minimum distance for binary linear codes are constructed. They are 5-generator QC [93 17 34] and [254,23, 102] codes, and related [96, 17, 361, [256, 23,104] codes.",

keywords = "Binary linear codes, quasi-cyclic codes, simplex codes",

author = "Chen, \{Eric Zhi\}",

year = "2007",

doi = "10.1109/TIT.2006.890727",

language = "English",

volume = "53",

pages = "1193--1196",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - New quasi-cyclic codes from simplex codes

AU - Chen, Eric Zhi

PY - 2007

Y1 - 2007

N2 - As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and 3-generator QC codes are studied, and many good, new QC codes are constructed from simplex codes. Some new binary QC codes or related codes, that improve the bounds on maximum minimum distance for binary linear codes are constructed. They are 5-generator QC [93 17 34] and [254,23, 102] codes, and related [96, 17, 361, [256, 23,104] codes.

AB - As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and 3-generator QC codes are studied, and many good, new QC codes are constructed from simplex codes. Some new binary QC codes or related codes, that improve the bounds on maximum minimum distance for binary linear codes are constructed. They are 5-generator QC [93 17 34] and [254,23, 102] codes, and related [96, 17, 361, [256, 23,104] codes.

KW - Binary linear codes

KW - quasi-cyclic codes

KW - simplex codes

U2 - 10.1109/TIT.2006.890727

DO - 10.1109/TIT.2006.890727

M3 - Article

SN - 0018-9448

VL - 53

SP - 1193

EP - 1196

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

New quasi-cyclic codes from simplex codes

Sammanfattning

Nationell ämneskategori

Åtkomst av dokument

Fingeravtryck

Citera det här