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≤k≤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.
Original language | English |
---|---|
Article number | 105963 |
Journal | Information Processing Letters |
Volume | 159-160 |
DOIs | |
Publication status | Published - 2020 Jul |
Keywords
- Combinatorial problems
- Linear complementary dual code
- Minimum weight
- Subcode
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications