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

T. Aaron Gulliver, Masaaki Harada

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)703-706
Number of pages4
JournalIEEE Transactions on Information Theory
Volume45
Issue number2
DOIs
Publication statusPublished - 1999 Dec 1
Externally publishedYes

Keywords

  • Quasi-cyclic codes
  • Quasi-symmetric designs
  • Selfcomplementary codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this