On Bounded-Weight Error-Correcting Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting codes, and evaluate the differences.
10 pages, 3 tables

Keywords

Information Theory, H.1.1; E.4

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv