An explicit construction of 2-generator quasi-twisted codes

Eric Zhi Chen

An explicit construction of 2-generator quasi-twisted codes

Eric Zhi Chen

Forskningsoutput: Tidskriftsbidrag › Artikel › Peer review

12 Citeringar (Scopus)

Sammanfattning

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.

Originalspråk	Engelska
Sidor (från-till)	5770-5773
Antal sidor	3
Tidskrift	IEEE Transactions on Information Theory
Volym	54
Nummer	12
Status	Publicerad - 2008

Nationell ämneskategori

Data- och informationsvetenskap (102)
Teknik (2)

Citera det här

@article{a35a0f0f1e4340ae8dda2d26fcff43ed,

title = "An explicit construction of 2-generator quasi-twisted codes",

abstract = "Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.",

keywords = "Linear codes, optimal codes, quasi-cyclic codes, quasi-twisted codes, simplex codes",

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

year = "2008",

language = "English",

volume = "54",

pages = "5770--5773",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "12",

}

TY - JOUR

T1 - An explicit construction of 2-generator quasi-twisted codes

AU - Chen, Eric Zhi

PY - 2008

Y1 - 2008

N2 - Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.

AB - Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that many codes in the family meet the Griesmer bound and therefore are length-optimal. New distance-optimal binary QC [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, and good ternary QC [208, 6, 135] and [221, 6, 144] codes are also obtained by the construction.

KW - Linear codes

KW - optimal codes

KW - quasi-cyclic codes

KW - quasi-twisted codes

KW - simplex codes

M3 - Article

SN - 0018-9448

VL - 54

SP - 5770

EP - 5773

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 12

ER -

An explicit construction of 2-generator quasi-twisted codes

Sammanfattning

Nationell ämneskategori

Fingeravtryck

Citera det här