Two new bounds on the size of binary codes with a minimum distance of three
type: Item
instance of: scholarly article
title: Two new bounds on the size of binary codes with a minimum distance of three
zbMATH Open document ID: 0835.94029
DOI: 10.1007/BF01388476
author: Yaron Klein
author: Alexander Vardy
author: Simon Litsyn
published in: Designs, Codes and Cryptography
publication date: 1996-04-22T00:00:00Z
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 828261
zbMATH Keywords: optimal codes
zbMATH Keywords: constant-weight codes
zbMATH Keywords: upper bounds
zbMATH Keywords: binary codes
zbMATH Keywords: minimum distance
MaRDI profile type: Publication
cites work: Q3834057
cites work: Binary codes with a minimum distance of four (Corresp.)
cites work: Bounds for binary codes of length less than 25
cites work: Q4039784
cites work: Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
cites work: Q4057549
cites work: The uniqueness of the Best code
cites work: Q4146667
description: scientific article; zbMATH DE number 828261