Now showing items 1-3 of 3
The sizes of optimal q-ary codes of weight three and distance four : a complete solution
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.
Improved lower bounds for constant GC-content DNA codes
The design of large libraries of oligonucleotides having constant GC-content and satisfying Hamming distance constraints between oligonucleotides and their Watson-Crick complements is important in reducing hybridization ...
Group divisible codes and their application in the construction of optimal constant-composition codes of weight three
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 useful in recursive constructions for ...