The study of subblock-constrained codes has recently gained attention due to their
application in diverse fields. We present bounds on the size and asymptotic rate for two …

Multiply constant-weight codes (MCWCs) have been recently studied to improve the
reliability of certain physically unclonable function response. In this paper, we give …

We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of
classes of codes, namely, constant-composition codes, nonbinary constant-weight codes …

A binary code C of length n=∑ mi= 1 ni and minimum distance d is said to be of multiply
constant-weight and denoted by MCWC (w1, n1; w2, n2;...; wm, nm; d), if each codeword has …

广义Howell 设计是一类双可分解设计, 与置换表, 多层常重码有密切联系.
本文利用可迁和不可迁starter-adder 直接构造方法和广义Howell 标架递推工具 …

Motivated by the applications to generalized Howell designs and multiply constant-weight
codes, we establish an asymptotic existence theorem for (k, λ)-frames of type gn with a pair …

Constructions for optimal multiply constant-weight codes (MCWCs) with total weight 5 and
distance 8 are studied. The equivalence between a special class of MCWCs and …

The study of binary constant subblock-composition codes (CSCCs) has recently gained
attention due to their application in diverse fields. These codes are a class of constrained …

For a subset I⊆F_q^n, let Δ(I) be the set of distances determined by the elements of I. The
Erdös--Falconer distance problem in F_q^n asks for a threshold on the cardinality |I| so that …

In this paper we give new constraints on the distance distribution of doubly constant-weight
(binary) codes. These constraints improve the linear programming bound on sizes of doubly …