On Linear Complementary Pairs of Codes

CARLET C., Guneri C., ÖZBUDAK F., Ozkaya B., SOLE P.

IEEE TRANSACTIONS ON INFORMATION THEORY, cilt.64, sa.10, ss.6583-6589, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 64 Sayı: 10
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1109/tit.2018.2796125
  • Dergi Adı: IEEE TRANSACTIONS ON INFORMATION THEORY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.6583-6589
  • Anahtar Kelimeler: Constacyclic code, quasi-cyclic code, LCP of codes, linear programming bound, QUASI-CYCLIC CODES, ALGEBRAIC STRUCTURE
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

We study linear complementary pairs (LCP) of codes (C, D), where both codes belong to the same algebraic code family. We especially investigate constacyclic and quasicyclic LCP of codes. We obtain characterizations for LCP of constacyclic codes and LCP of quasi-cyclic codes. Our result for the constacyclic complementary pairs extends the characterization of linear complementary dual (LCD) cyclic codes given by Yang and Massey. We observe that when C and I) are complementary and constacyclic, the codes C and D-perpendicular to are equivalent to each other. Hence, the security parameter min(d(C), d(D-perpendicular to)) for LCP of codes is simply determined by one of the codes in this case. The same holds for a special class of quasi-cyclic codes, namely 2D cyclic codes, but not in general for all quasi-cyclic codes, since we have examples of LCP of double circulant codes not satisfying this conclusion for the security parameter. We present examples of binary LCP of quasi-cyclic codes and obtain several codes with better parameters than known binary LCD codes. Finally, a linear programming hound is obtained for binary LCP of codes and a table of values from this bound is presented in the case d(C) = d(D-perpendicular to). This extends the linear programming bound for LCD codes.