Constructions of optimal LCD codes over large finite fields (Q1696753)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6838992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructions of optimal LCD codes over large finite fields |
scientific article; zbMATH DE number 6838992 |
Statements
Constructions of optimal LCD codes over large finite fields (English)
0 references
15 February 2018
0 references
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.
0 references
orthogonal matrices
0 references
complementary dual codes
0 references
LCD
0 references
matrix product codes
0 references
optimal codes
0 references
0.8529634475708008
0 references
0.8486449122428894
0 references
0.8485009074211121
0 references
0.8440769910812378
0 references
0.8411391973495483
0 references
