Now showing items 1-4 of 4
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 ...
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 ...
Cyclic codes over GR(p2,m) of length pk
We study cyclic codes of length pk over GR(p2,m), or equivalently, ideals of the ring GR(p2,m)/ upk − 1 . We derive a method of representing the ideals, and classify all ideals in the ring GR(p2,m)/upk −1 . We also analyse ...