Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes

T. Aaron Gulliver, Masaaki Harada

研究成果: Article査読

17 被引用数 (Scopus)

抄録

In this paper it is shown that the weight enumerator of a bordered double circulant self-dual code can be obtained from those of a pure double circulant self-dual code and its shadow through a relationship between bordered and pure double circulant codes. As applications, a restriction on the weight enumerators of some extremal double circulant codes is determined and a uniqueness proof of extremal double circulant self-dual codes of length 46 is given. New extremal singly-even [44, 22, 8] double circulant codes are constructed. These codes have weight enumerators for which extremal codes were not previously known to exist.

本文言語English
ページ(範囲)141-150
ページ数10
ジャーナルDesigns, Codes, and Cryptography
11
2
DOI
出版ステータスPublished - 1997
外部発表はい

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンスの応用
  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「Weight Enumerators of Double Circulant Codes and New Extremal Self-Dual Codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル