New binary linear codes which are dual transforms of good codes

D.B. Jaffe; J. Simonis

doi:10.1109/18.782159

New binary linear codes which are dual transforms of good codes

D.B. Jaffe, J. Simonis

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

9 Citations (Scopus)

Abstract

If C is a binary linear code, one may choose a subset S of C, and form a new code CST which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for picking S, we obtain codes with record-breaking parameters [92,8,44], [105,8,50], [108,8,52], [79,9,36], [123,9,58], [130,9,62], [175,9,84], [242,9,118], and [245,9,120].

Original language	English
Pages (from-to)	2136-2137
Journal	IEEE Transactions on Information Theory
Volume	45
Issue number	6
DOIs	https://doi.org/10.1109/18.782159
Publication status	Published - 1999

Access to Document

10.1109/18.782159

Cite this

@article{4dd4bfbbeaff46b58fe9a07c97b0586e,

title = "New binary linear codes which are dual transforms of good codes",

abstract = "If C is a binary linear code, one may choose a subset S of C, and form a new code CST which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for picking S, we obtain codes with record-breaking parameters [92,8,44], [105,8,50], [108,8,52], [79,9,36], [123,9,58], [130,9,62], [175,9,84], [242,9,118], and [245,9,120].",

author = "D.B. Jaffe and J. Simonis",

year = "1999",

doi = "10.1109/18.782159",

language = "English",

volume = "45",

pages = "2136--2137",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "6",

}

TY - JOUR

T1 - New binary linear codes which are dual transforms of good codes

AU - Jaffe, D.B.

AU - Simonis, J.

PY - 1999

Y1 - 1999

N2 - If C is a binary linear code, one may choose a subset S of C, and form a new code CST which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for picking S, we obtain codes with record-breaking parameters [92,8,44], [105,8,50], [108,8,52], [79,9,36], [123,9,58], [130,9,62], [175,9,84], [242,9,118], and [245,9,120].

AB - If C is a binary linear code, one may choose a subset S of C, and form a new code CST which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for picking S, we obtain codes with record-breaking parameters [92,8,44], [105,8,50], [108,8,52], [79,9,36], [123,9,58], [130,9,62], [175,9,84], [242,9,118], and [245,9,120].

U2 - 10.1109/18.782159

DO - 10.1109/18.782159

M3 - Article

SN - 0018-9448

VL - 45

SP - 2136

EP - 2137

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

New binary linear codes which are dual transforms of good codes

Abstract

Access to Document

Fingerprint

Cite this