most citedConstructions of q-Ary Constant-Weight Codes

60 citations · 185 across the 11 of their papers we have counts for

collaborators
Showing cs.ITShow all

7 papers · 1 filter

cs.IT200832 cited

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three

Yeow Meng Chee, Gennian Ge, Alan C. H. Ling

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be usef…

cs.IT200818 cited

The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution

Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling +1

This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.

cs.IT200850 cited

Improved Lower Bounds for Constant GC-Content DNA Codes

Yeow Meng Chee, San Ling

The design of large libraries of oligonucleotides having constant GC-content and satisfying Hamming distance constraints between oligonucleotides and their Watson-Crick complements…

cs.IT2007

A New Lower Bound for A(17,6,6)

Yeow Meng Chee

We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.

cs.IT2007

Constructions for Difference Triangle Sets

Yeow Meng Chee, Charles J. Colbourn

Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference…

cs.IT200722 cited

The PBD-Closure of Constant-Composition Codes

Yeow Meng Chee, Alan C. H. Ling, San Ling +1

We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure re…