Now showing items 1-10 of 49
A family of group character codes
In IEEE Trans. Inform. Theory 46 (2000), 280, using characters of an elementary Abelian 2-group, a class of q-ary codes, where q is an odd prime power, is constructed. These codes share several features in common with ...
Constructions of semi-regular relative difference sets
J. A. Davis, J. Jedwab, and M. Mowbray (1998, Des. Codes Cryptogr. 13, 131-146) gave two new constructions for semi-regular relative difference sets (RDSs). They asked if the two constructions could be unified. In this ...
New lower bounds and constructions for binary codes correcting asymmetric errors
In this correspondence, we study binary asymmetric error-correcting codes. A general construction for binary asymmetric error-correcting codes is presented. We show that some previously known lower bounds for binary ...
A class of linear codes with good parameters from algebraic curves
A class of linear codes with good parameters is constructed in this correspondence. It turns out that linear codes of this class are subcodes of the subfield subcodes of Goppa's geometry codes. In particular, we find 61 ...
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 ...
The PBD-closure of constant-composition codes
We show an interesting pairwise balanced design (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 result is that ...
Constructions for q-ary constant-weight codes
This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between ...
Linear size optimal q-ary constant-weight codes and constant-composition codes
An optimal constant-composition or constant-weight code of weight w has linear size if and only if its distance d is at least 2w-1. When d ≥ 2w, the determination of the exact size of such a constant-composition or ...
Cycle systems in the complete bipartite graph plus a one-factor
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n+I denote Kn,n with a one-factor added. It is proved in this paper that there exists an m-cycle system ...