5 citations · 11 across the 9 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2019
Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations
Yeow Meng Chee, Hui Zhang, Xiande Zhang
The study of Armstrong codes is motivated by the problem of understanding complexities of dependencies in relational database systems, where attributes have bounded domains. A $(q,…
math.CO2014★ 5 cited
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 +3
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 and…