Binary optimal linear rate 1/2 codes

Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

In this paper, we classify the optimal linear [n, n/2] codes of length upto 12. We show that there is a unique optimal odd formally self-dual [20],[10],[6] code upto equivalence. We also show that at least one optimal linear [n, n/2] code is self-dual or formally self-dual for lengths upto 48 (except 38 and 40).

本文言語English
ホスト出版物のタイトルApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 13th International Symposium, AAECC-13, Proceedings
編集者Marc Fossorier, Shu Lin, Hideki Imai, Alain Poli
出版社Springer Verlag
ページ462-471
ページ数10
ISBN(印刷版)3540667237, 9783540667230
DOI
出版ステータスPublished - 1999 1 1
外部発表はい
イベント13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1999 - Honolulu, United States
継続期間: 1999 11 151999 11 19

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1719
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1999
CountryUnited States
CityHonolulu
Period99/11/1599/11/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Binary optimal linear rate 1/2 codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル