New Upper Bounds on A(n,d)

Simple item page
dc.creatorMounits, Beniamin
dc.creatorEtzion, Tuvi
dc.creatorLitsyn, Simon
dc.date2005-08-24
dc.date.accessioned2026-07-07T08:15:36Z
dc.date.available2026-07-07T08:15:36Z
dc.descriptionUpper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds improve on the best known analytic bounds. Several new record bounds are obtained for codes with small lengths.
dc.descriptionTo appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005
dc.identifierhttps://arxiv.org/abs/cs/0508107
dc.identifierhttp://arxiv.org/abs/cs/0508107
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133497
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleNew Upper Bounds on A(n,d)
dc.typetext

Files

Collections

arXiv