New Bounds and Constructions for Multiply Constant-Weight Codes
From MaRDI portal
Abstract: Multiply constant-weight codes (MCWCs) were introduced recently to improve the reliability of certain physically unclonable function response. In this paper, the bounds of MCWCs and the constructions of optimal MCWCs are studied. Firstly, we derive three different types of upper bounds which improve the Johnson-type bounds given by Chee {sl et al.} in some parameters. The asymptotic lower bound of MCWCs is also examined. Then we obtain the asymptotic existence of two classes of optimal MCWCs, which shows that the Johnson-type bounds for MCWCs with distances or are asymptotically exact. Finally, we construct a class of optimal MCWCs with total weight four and distance six by establishing the connection between such MCWCs and a new kind of combinatorial structures. As a consequence, the maximum sizes of MCWCs with total weight less than or equal to four are determined almost completely.
Cited in
(8)- Improved linear programming bound on sizes of doubly constant-weight codes
- Optimal multiply constant-weight codes from generalized Howell designs
- The asymptotic existence of frames with a pair of orthogonal frame resolutions
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- Erdős-Falconer distance problem under Hamming metric in vector spaces over finite fields
- A new construction for \(q\)-ary constant weight codes
- On the Construction of Multiply Constant-Weight Codes
- Constructions of optimal multiply constant-weight codes MCWC(3,n₁; 1,n₂; 1,n₃; 8)s
This page was built for publication: New Bounds and Constructions for Multiply Constant-Weight Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976510)