Constructions of q-Ary Constant-Weight Codes

Simple item page
dc.creatorChee, Yeow Meng
dc.creatorLing, San
dc.date2007-05-01
dc.date.accessioned2026-07-07T08:16:01Z
dc.date.available2026-07-07T08:16:01Z
dc.descriptionThis 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.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/0705.0081
dc.identifierhttp://arxiv.org/abs/0705.0081
dc.identifierIEEE Transactions on Information Theory, Vol. 53, No. 1, January 2007, pp. 135-146
dc.identifierdoi:10.1109/TIT.2006.887499
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133639
dc.subjectInformation Theory
dc.titleConstructions of q-Ary Constant-Weight Codes
dc.typetext

Files

Collections

arXiv