New Upper Bounds on A(n,d)

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Upper 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.
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005

Keywords

Information Theory, Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/133497

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0508107
 http://arxiv.org/abs/cs/0508107

Collections

arXiv