The smallest length of binary 7-dimensional linear codes with prescribed minimum distance

Research output: Contribution to journalArticleAcademicpeer-review

33 Citations (Scopus)

Abstract

Let n(k,d) denote the smallest value of n for which a binary (n,k,d) code exists. Then n(k, d) was known for all d, when k 6. All values of n(7, d) will now be presented.
Original languageEnglish
Pages (from-to)197-207
Number of pages11
JournalDiscrete Mathematics
Volume33
Issue number2
DOIs
Publication statusPublished - 1981

Fingerprint Dive into the research topics of 'The smallest length of binary 7-dimensional linear codes with prescribed minimum distance'. Together they form a unique fingerprint.

  • Cite this