Binary linear complementary dual codes

Abstract

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary linear complementary dual $[n,k]$ codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete classification of binary linear complementary dual $[n,k]$ codes with the largest minimum weight is also given for $1\le k\le n\le 16$.

28 pages

References in corpus (1)

• LCD codes over ${\mathbb{F}}_q$ are as good as linear codes for q at least four

Cited by in corpus (12)

• Optimal Binary LCD Codes
• On the classification of linear complementary dual codes
• On the minimum weights of binary linear complementary dual codes
• Some new bounds on LCD codes over finite fields
• Binary optimal linear codes with various hull dimensions and entanglement-assisted QECC
• Minimum distances of binary optimal LCD codes of dimension five are completely determined
• Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes
• On the largest minimum distances of [n,6] LCD codes
• Characterization and classification of optimal LCD codes
• Binary LCD Codes from ${\mathbb{Z}}_2{\mathbb{Z}}_2[u]$
• Binary LCD Codes and Self-orthogonal Codes via Simplicial Complexes
• Construction for both self-dual codes and LCD codes