Logo image
DECOMPOSITIONS OF EDGE-COLORED DIGRAPHS: A NEW TECHNIQUE IN THE CONSTRUCTION OF CONSTANT-WEIGHT CODES AND RELATED FAMILIES
Journal article   Peer reviewed

DECOMPOSITIONS OF EDGE-COLORED DIGRAPHS: A NEW TECHNIQUE IN THE CONSTRUCTION OF CONSTANT-WEIGHT CODES AND RELATED FAMILIES

Yeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang and Xiande Zhang
SIAM journal on discrete mathematics, Vol.33(1), pp.209-229
01/01/2019

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes, group divisible codes, and multiply constant-weight codes. We achieve this via an application of the theory of decomposition of edge-colored digraphs.

Metrics

1 Record Views

Details

Logo image