On Linear Complementary Pairs of Codes
- 23 January 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 64 (10) , 6583-6589
Abstract
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 D are complementary and constacyclic, the codes C and D ⊥ are equivalent to each other. Hence, the security parameter min(d(C), d(D ⊥ )) 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 bound is obtained for binary LCP of codes and a table of values from this bound is presented in the case d(C) = d(D ⊥ ). This extends the linear programming bound for LCD codes.Keywords
Funding Information
- TÜBİTAK Project, which is associated with the SECODE Project in the scope of the CHIST-ERA Program (215E200)
- SECODE Project
This publication has 10 references indexed in Scilit:
- The combinatorics of LCD codes: linear programming bound and orthogonal matricesInternational Journal of Information and Coding Theory, 2017
- Quasi-cyclic complementary dual codesFinite Fields and Their Applications, 2016
- Linear complementary dual code improvement to strengthen encoded circuit against hardware Trojan horses2015
- On self-dual constacyclic codes over finite fieldsDesigns, Codes and Cryptography, 2013
- A relation between quasi-cyclic codes and 2-D cyclic codesFinite Fields and Their Applications, 2012
- On the Algebraic Structure of Quasi-Cyclic Codes III: Generator TheoryIEEE Transactions on Information Theory, 2005
- On the algebraic structure of quasi-cyclic codes .I. Finite fieldsIEEE Transactions on Information Theory, 2001
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- The condition for a cyclic code to have a complementary dualDiscrete Mathematics, 1994
- Classification of pseudo-cyclic MDS codesIEEE Transactions on Information Theory, 1991