TY - JOUR
T1 - Codes of lengths 120 and 136 meeting the grey-rankin bound and quasi-symmetric designs
AU - Aaron Gulliver, T.
AU - Harada, Masaaki
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
KW - Quasi-cyclic codes
KW - Quasi-symmetric designs
KW - Selfcomplementary codes
UR - http://www.scopus.com/inward/record.url?scp=0033100748&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033100748&partnerID=8YFLogxK
U2 - 10.1109/18.749017
DO - 10.1109/18.749017
M3 - Article
AN - SCOPUS:0033100748
SN - 0018-9448
VL - 45
SP - 703
EP - 706
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 2
ER -