DocumentCode
1478860
Title
Codes of lengths 120 and 136 meeting the Grey-Rankin bound and quasi-symmetric designs
Author
Gulliver, T. Aaron ; Harada, Masaaki
Author_Institution
Dept. of Electr. & Electron. Eng., Canterbury Univ., Christchurch, New Zealand
Volume
45
Issue
2
fYear
1999
fDate
3/1/1999 12:00:00 AM
Firstpage
703
Lastpage
706
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 (symmetric difference property) designs are constructed from these codes
Keywords
binary codes; cyclic codes; linear codes; polynomials; Grey-Rankin bound; [120,9,56] code; [136,9,64] code; binary linear codes; optimal codes; quasi-cyclic self-complementary codes; quasi-symmetric designs; symmetric difference property; Linear code; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.749017
Filename
749017
Link To Document