Remark on subcodes of linear complementary dual codes

Abstract

We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2\le k\le n$. As a consequence, we derive a bound on the largest minimum weights among ternary Euclidean linear complementary dual codes and quaternary Hermitian linear complementary dual codes.

arXiv comment7 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 (3)

• Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes
• Characterization and classification of optimal LCD codes
• On the existence of quaternary Hermitian LCD codes with Hermitian dual distance $1$