On complementary-dual quasi-cyclic codes (Q1017419): Difference between revisions

A linear code with a complementary dual (an LCD code) is a linear code \(C\) whose dual \(C^ \perp\) satisfies \(C\cap C^ \perp= \{0\}\). Necessary and sufficient conditions for a cyclic code be an LCD code were given by \textit{X. Yang} and \textit{J. L. Massey} [Discrete Math. 126, No. 1--3, 391--393 (1994; Zbl 0790.94022)]. Here the authors study the same problem for quasi-cyclic (QC) codes. They identify few classes of LCD quasi-cyclic codes. A sufficient condition for a \(\rho \)-generator QC code \(C\) is given under which \(C\) is an LCD code. Another sufficient condition is given for maximal 1-generator codes. Two necessary and sufficient conditions for a maximal 1-generator QC code \(C\) satisfying certain constraints to be an LCD code are provided. It is shown that unlike cyclic codes, a maximal 1-generator index-2 QC code is reversible if and only if it is a self-dual code. Several classes of LCD QC codes are introduced.