New binary linear codes which are dual transforms of good codes

Authors
Jaffe, DB Simonis, J
Citation
Db. Jaffe et J. Simonis, New binary linear codes which are dual transforms of good codes, IEEE INFO T, 45(6), 1999, pp. 2136-2137
Citations number
6
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
45
Issue
6
Year of publication
1999
Pages
2136 - 2137
Database
ISI
SICI code
0018-9448(199909)45:6<2136:NBLCWA>2.0.ZU;2-8
Abstract
If C is a binary linear code, one may choose a subset S of C, and form a ne w code C-S(T) 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 p icking 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].