\(G\)-projectable and \(\Lambda\)-projectable binary linear block codes (Q2384056): Difference between revisions

In this paper the authors consider some projections of binary codes onto quaternary codes. It is known that there is a relation between the binary \([24,12,8]\) Golay code \({\mathcal G}_{24}\) and the quaternary \([6,3,4]\) Hexacode, and between the \([32,16,8]\) Reed-Muller code and the quaternary self-dual \([8,4,4]\) code. This type of relation has led to the introduction of concepts called projections \(O\) and \(E\). Following this idea several authors tried to find other codes among the known binary codes, having similar structures or to construct new such codes. The projection \(E\) was extended to projection \(G\) by [\textit{J.-L. Kim, K. E. Mellinger} and \textit{V. Pless}, SIAM J. Discrete Math. 16, No.~4, 591--603 (2003; Zbl 1055.94031)]. In the article under review the authors give a uniform characterization of these known projections. They introduce a projection \(\Lambda\) that covers the projections \(O, E\), and \(G\). Moreover, they characterize \(G\)-projectable self-dual codes and \(\Lambda\)-projectable codes. Explicit methods for constructing codes having \(G\) and \(\Lambda\) projections are given and several thus constructed codes that have best known optimal parameters are introduced.