On the Construction of Binary Optimal LCD Codes with Short Length.

A q -ary linear code 𝒞 is called a linear complementary dual (LCD) code if it meets its dual trivially. Binary LCD codes play a significant role for their advantage of low complexity for implementations against side-channel attacks and fault injection attacks. In this paper, the problem of finding LCD codes over the binary field is discussed. Many new codes and new bounds are presented, as well as a table of optimal LCD codes (or upper and lower bounds on such codes) of length up to 30 bits. [ABSTRACT FROM AUTHOR]