Remark on subcodes of linear complementary dual codes

Masaaki Harada, Ken Saito

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Article number105963
JournalInformation Processing Letters
Volume159-160
DOIs
Publication statusPublished - 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

Fingerprint Dive into the research topics of 'Remark on subcodes of linear complementary dual codes'. Together they form a unique fingerprint.

Cite this