Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families

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 decompositio...

Full description

Saved in:
Bibliographic Details
Main Authors: Chee, Yeow Meng, Gao, Fei, Kiah, Han Mao, Zhang, Hui, Zhang, Xiande, Ling, Alan Chi Hung
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2019
Subjects:
Online Access:https://hdl.handle.net/10356/86252
http://hdl.handle.net/10220/49277
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-86252
record_format dspace
spelling sg-ntu-dr.10356-862522023-02-28T19:31:54Z Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families Chee, Yeow Meng Gao, Fei Kiah, Han Mao Zhang, Hui Zhang, Xiande Ling, Alan Chi Hung School of Physical and Mathematical Sciences Edge-colored Digraphs Constant-weight Codes Science::Physics 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. MOE (Min. of Education, S’pore) Published version 2019-07-11T03:02:31Z 2019-12-06T16:18:56Z 2019-07-11T03:02:31Z 2019-12-06T16:18:56Z 2019 Journal Article Chee, Y. M., Gao, F., Kiah, H. M., Ling, A. C. H., Zhang, H., & Zhang, X. (2019). Decompositions of Edge-Colored Digraphs : A New Technique in the Construction of Constant-Weight Codes and Related Families. SIAM Journal on Discrete Mathematics, 33(1), 209-229. doi:10.1137/17M1136171 0895-4801 https://hdl.handle.net/10356/86252 http://hdl.handle.net/10220/49277 10.1137/17M1136171 en SIAM Journal on Discrete Mathematics © 2019 SIAM. All rights reserved. This paper was published in SIAM Journal on Discrete Mathematics and is made available with permission of SIAM. 21 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Edge-colored Digraphs
Constant-weight Codes
Science::Physics
spellingShingle Edge-colored Digraphs
Constant-weight Codes
Science::Physics
Chee, Yeow Meng
Gao, Fei
Kiah, Han Mao
Zhang, Hui
Zhang, Xiande
Ling, Alan Chi Hung
Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
description 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.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Chee, Yeow Meng
Gao, Fei
Kiah, Han Mao
Zhang, Hui
Zhang, Xiande
Ling, Alan Chi Hung
format Article
author Chee, Yeow Meng
Gao, Fei
Kiah, Han Mao
Zhang, Hui
Zhang, Xiande
Ling, Alan Chi Hung
author_sort Chee, Yeow Meng
title Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
title_short Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
title_full Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
title_fullStr Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
title_full_unstemmed Decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
title_sort decompositions of edge-colored digraphs : a new technique in the construction of constant-weight codes and related families
publishDate 2019
url https://hdl.handle.net/10356/86252
http://hdl.handle.net/10220/49277
_version_ 1759853872453517312