Lower bounds on the minimum average distance of binary codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
19 pages

Keywords

Information Theory, Combinatorics

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0706.3295
 http://arxiv.org/abs/0706.3295

Collections

arXiv