Binary linear complementary dual codes

Masaaki Harada, Ken Saito

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

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 ≤ k ≤ n ≤ 16.

Original languageEnglish
Pages (from-to)677-696
Number of pages20
JournalCryptography and Communications
Volume11
Issue number4
DOIs
Publication statusPublished - 2019 Jul 15

Keywords

  • Binary code
  • K-cover
  • Linear complementary dual code

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

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

Cite this