On the minimum weights of binary linear complementary dual codes

Makoto Araya, Masaaki Harada

Research output: Contribution to journalArticle

Abstract

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weights d(n,k) among all binary linear complementary dual [n,k] codes. We determine d(n,4) for n ≡ 2,3,4,5,6,9,10,13 (mod 15), and d(n,5) for n ≡ 3,4,5,7,11,19,20, 22,26 (mod 31). Combined with known results, d(n,k) are also determined for n ≤ 24.

Original languageEnglish
Pages (from-to)285-300
Number of pages16
JournalCryptography and Communications
Volume12
Issue number2
DOIs
Publication statusPublished - 2020 Mar 1

Keywords

  • Binary code
  • Griesmer bound
  • 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 'On the minimum weights of binary linear complementary dual codes'. Together they form a unique fingerprint.

  • Cite this