LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Some bounds on binary LCD codes

Photo by cgower from unsplash

A linear code with a complementary dual (or An LCD code) is defined to be a linear code C whose dual code C⊥ satisfies C ∩ C⊥= 0$\left \{ \mathbf… Click to show full abstract

A linear code with a complementary dual (or An LCD code) is defined to be a linear code C whose dual code C⊥ satisfies C ∩ C⊥= 0$\left \{ \mathbf {0}\right \} $. Let LD (n, k) denote the maximum of possible values of d among [n, k, d] binary LCD codes. We give the exact values of LD (n, k) for k = 2 for all n and some bounds on LD (n, k) for other cases. From our results and some direct search we obtain a complete table for the exact values of LD (n, k) for 1 ≤ k ≤ n ≤ 12. As a consequence, we also derive bounds on the dimensions of LCD codes with fixed lengths and minimum distances.

Keywords: lcd codes; binary lcd; bounds binary; code

Journal Title: Cryptography and Communications
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.