New Constructions of Optimal Binary LCD Codes
share
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let d_LCD(n, k) denote the maximum value of d for which a binary [n,k, d] LCD code exists. In <cit.>, Bouyuklieva conjectured that d_LCD(n+1, k)=d_LCD(n, k) or d_LCD(n, k) + 1 for any lenth n and dimension k ≥ 2. In this paper, we first prove Bouyuklieva's conjecture <cit.> by constructing a binary [n,k,d-1] LCD codes from a binary [n+1,k,d] LCD_o,e code, when d ≥ 3 and k ≥ 2. Then we provide a distance lower bound for binary LCD codes by expanded codes, and use this bound and some methods such as puncturing, shortening, expanding and extension, we construct some new binary LCD codes. Finally, we improve some previously known values of d_LCD(n, k) of lengths 38 ≤ n ≤ 40 and dimensions 9 ≤ k ≤ 15. We also obtain some values of d_LCD(n, k) with 41 ≤ n ≤ 50 and 6 ≤ k ≤ n-6.
READ FULL TEXT
