Constructions of optimal LCD codes over large finite fields

From MaRDI portal



Abstract: In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.


The article under review deals with linear complementary dual (LCD) codes, that is codes whose hull is equal to the zero vector space. LCD codes have several applications in cryptography. Note that, for fields with size greater than 3, the existence LCD codes is solved by [\textit{C. Carlet} et al., IEEE Trans. Inf. Theory 64, No. 4, Part 2, 3010--3017 (2018; Zbl 1392.94926)]. The article under review considers MDS self-dual codes and MDS self-orthogonal codes from the bibliography to construct MDS LCD codes. Moreover, they give explicit constructions of LCD and matrix product LCD codes with optimal parameters by sampling elements in the orthogonal group, by code extension, by considering matrix product codes and by projecting over a self-dual basis.




Cited in
(59)


Describes a project that uses

Uses Software






This page was built for publication: Constructions of optimal LCD codes over large finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696753)