Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
Yeow Meng Chee, Han Mao Kiah, Hui Zhang, Xiande Zhang · IEEE Transactions on Information Theory · 2017
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for the MCWCs, which yield several new infinite families of optimal MCWCs. Furthermore, we demonstrate that the Johnson-type upper bounds of the MCWCs are asymptotically tight for fixed Hamming weights and distances. Finally, we provide bounds and constructions of the 2-D MCWCs.