Characterization and classification of optimal LCD codes (Q831153)
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 7346948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization and classification of optimal LCD codes |
scientific article; zbMATH DE number 7346948 |
Statements
Characterization and classification of optimal LCD codes (English)
0 references
10 May 2021
0 references
A code \(C\) is said to be LCD (linear complementary dual) if \(C\cap C^\perp=\{0\}\). LCD codes have been a central theme in coding theory due to their application to data storage, cryptography \& side-channel attacks. In this paper, the authors give a characterization of LCD codes over binary and ternary fields having large minimum weights. Using the same techniques, they also determine the largest minimum weights of LCD codes for small choices of field size and dimension (with arbitrary \(n\)), provide a classification of optimal binary LCD codes with \((q,k)\in\{(2,3),(2,4),(3,2),(3,3)\}\).
0 references
linear complementary dual code
0 references
binary code
0 references
ternary code
0 references
simple code
0 references
Griesmer bound
0 references
0.8983401656150818
0 references
0.8924184441566467
0 references
0.8864142298698425
0 references
0.8857589364051819
0 references
0.8636780977249146
0 references
