Characterization and classification of optimal LCD codes (Q831153)

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)\}\).