On the minimum weights of binary linear complementary dual codes

Makoto Araya, Masaaki Harada

Research output: Contribution to journalArticlepeer-review

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 weight 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, the values d(n, k) are also determined for n ≤ 24.

Original languageEnglish
JournalUnknown Journal
Publication statusPublished - 2018 Jul 10

ASJC Scopus subject areas

  • General

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