Two new bounds on the size of binary codes with a minimum distance of three

Yaron Klein, Simon Litsyn, Alexander Vardy

Research output: Contribution to journalArticlepeer-review

Abstract

We prove two new upper bounds on the size of binary codes with a minimum distance of three, namely A(10, 3)≤76 and A(11, 3)≤152.

Original languageEnglish
Pages (from-to)219-227
Number of pages9
JournalDesigns, Codes, and Cryptography
Volume6
Issue number3
DOIs
StatePublished - Nov 1995

Keywords

  • bounds on the size of a code
  • constant-weight codes
  • optimal codes

Fingerprint

Dive into the research topics of 'Two new bounds on the size of binary codes with a minimum distance of three'. Together they form a unique fingerprint.

Cite this