Codes of lengths 120 and 136 meeting the grey-rankin bound and quasi-symmetric designs

T. Aaron Gulliver, Masaaki Harada

研究成果: Article査読

2 被引用数 (Scopus)

抄録

In this correspondence, we give a characterization of certain quasi-cyclic self-complementary codes with parameters [120,9,56] and [136,9,64]. Some quasi-cyclic self-complementary codes are also constructed with parameters [496,11,240] and [528,11,256]. These codes are optimal in the sense that they meet the Grey-Rankin bound. New quasi-symmetric SDP designs are constructed from these codes.

本文言語English
ページ(範囲)703-706
ページ数4
ジャーナルIEEE Transactions on Information Theory
45
2
DOI
出版ステータスPublished - 1999
外部発表はい

ASJC Scopus subject areas

  • 情報システム
  • コンピュータ サイエンスの応用
  • 図書館情報学

引用スタイル