Characterization and classification of optimal LCD codes

Abstract: Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over

m a t h b b F_{q}

having large minimum weights for

q i n 2, 3

. Using the characterization, we determine the largest minimum weights among LCD

[n, k]

codes over

m a t h b b F_{q}

for

(q, k) i n (2, 4), (3, 2), (3, 3)

. Moreover, we give a complete classification of optimal LCD

[n, k]

codes over

m a t h b b F_{q}

for

(q, k) i n (2, 3), (2, 4), (3, 2), (3, 3)

.

Review text

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

Recommendations

Cites work

Cited in

(24)

Describes a project that uses

Uses Software

This page was built for publication: Characterization and classification of optimal LCD codes

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