Now showing items 1-4 of 4
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 ...
Constructions and bounds on linear error-block codes
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of ...
Some constructions of (t, m, s)-nets with improved parameters
We construct families of digital (t, m, s)-nets over F4 improving the best known parameters of (t, m, s)-nets. We also improve the bound of Niederreiter and Xing in the asymptotic theory of digital (t, m, s)-nets.