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

DOI10.1007/BF01388476zbMath0835.94029MaRDI QIDQ1904422

Alexander Vardy, Yaron Klein, Simon N. Litsyn

Publication date: 22 April 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

upper boundsbinary codesminimum distanceoptimal codesconstant-weight codes

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (2)

A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES ⋮ Strand design for biomolecular computation.

Cites Work

• Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
• Binary codes with a minimum distance of four (Corresp.)
• Bounds for binary codes of length less than 25
• The uniqueness of the Best code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two new bounds on the size of binary codes with a minimum distance of three