Constructions of q-Ary Constant-Weight Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary constant-weight codes and sets of pairwise disjoint combinatorial designs of various types.
12 pages

Keywords

Information Theory

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0705.0081
 http://arxiv.org/abs/0705.0081
 IEEE Transactions on Information Theory, Vol. 53, No. 1, January 2007, pp. 135-146
 doi:10.1109/TIT.2006.887499

Collections

arXiv