Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
Abstract
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 MCWCs which yield several new infinite families of optimal MCWCs. Furthermore, we demonstrate that the Johnson type upper bounds of MCWCs are asymptotically tight for fixed weights and distances. Finally, we provide bounds and constructions of two dimensional MCWCs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.