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

DOI10.1007/BF01388476MaRDI QIDQ1904422zbMATH OpenFDO

Authors Yaron Klein, Alexander Vardy, Simon Litsyn

Publication date 22 April 1996

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

Full work available at URL https://doi.org/10.1007/BF01388476

zbMATH Keywords

binary codesconstant-weight codesminimum distanceoptimal codesupper bounds

Mathematics Subject Classification ID

Bounds on codes (94B65)

Recommendations

• scientific article; zbMATH DE number 1456831
• scientific article; zbMATH DE number 1498813
• Bounds for Binary Codes With Narrow Distance Distributions
• Bounds for binary codes of length less than 25
• A new upper bound for binary codes with minimum distance four

Cites work

• Binary codes with a minimum distance of four (Corresp.)
• Bounds for binary codes of length less than 25
• scientific article; zbMATH DE number 4110700 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
• The uniqueness of the Best code

Cited in

(9)

• Strand design for biomolecular computation.
• Note on the size of binary Armstrong codes
• Binary codes with a minimum distance of four (Corresp.)
• The uniqueness of the Best code
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• Three best binary linear block codes of minimum distance fifteen
• scientific article; zbMATH DE number 1456831 (Why is no real title available?)
• A simple proof of the improved Johnson bound for binary codes
• On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904422)