Classification Algorithms for Codes and Designs Page 1 Algorithms and Computation in
Mathematics Volume 15 ฀ Classification Algorithms for Codes and Designs Classification …

Frequency hopping spread spectrum and direct sequence spread spectrum are two main
spread coding technologies in communication systems. Frequency hopping sequences are …

We derive theoretical upper and lower bounds on the maximum size of DNA codes of length
n with constant GC-content w and minimum Hamming distance d, both with and without the …

Starters and their connections with codes are discussed. It is shown that there exists a skew
starter in Zv for all v such that gcd (v, 6)= 1, v is either not divisible by 5 or divisible by 25 …

Error-correcting codes were introduced to combat errors in communication channels,
storage devices, and other computerized systems. In each such system, the information may …

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 …

In this paper, a new construction of zero-difference balanced functions defined on is given,
where is an odd positive integer. Based on the generic constructions proposed by Ding …

In this paper, we define a large set plus of disjoint incomplete Latin squares (LDILS+), and
prove that there exists an LDILS+(n+ a, a) if and only if 0≤ a≤ n and (n, a)≠(2, 1),(6, 5) …

One of the main problems of subspace coding is to determine the maximal size of a constant
dimension subspace code with given parameters. In this paper, we show that mixed …

Zero-difference balanced (ZDB) functions were introduced recently by Ding for the
construction of optimal constant-composition codes, and optimal and perfect difference …