Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
classification
💻 cs.IT
math.COmath.IT
keywords
mcwcsconstructionsboundscodesconstant-weightmultiplyoptimalasymptotically
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.