Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
From MaRDI portal
Abstract: We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response. We extend classical coding methods to construct multiply constant-weight codes from known -ary and constant-weight codes. Analogues of Johnson bounds are derived and are shown to be asymptotically tight to a constant factor under certain conditions. We also examine the rates of the multiply constant-weight codes and interestingly, demonstrate that these rates are the same as those of constant-weight codes of suitable parameters. Asymptotic analysis of our code constructions is provided.
Cited in
(12)- Statistical properties of side-channel and fault injection attacks using coding theory
- Improved linear programming bound on sizes of doubly constant-weight codes
- Optimal multiply constant-weight codes from generalized Howell designs
- Challenge codes for physically unclonable functions with Gaussian delays: a maximum entropy problem
- On existence of two classes of generalized Howell designs with block size three and index two
- The asymptotic existence of frames with a pair of orthogonal frame resolutions
- On generalized Howell designs with block size three
- 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
- On the Construction of Multiply Constant-Weight Codes
- Constructions of optimal multiply constant-weight codes MCWC(3,n₁; 1,n₂; 1,n₃; 8)s
- On generalized Howell designs with block size four and their applications to multiply constant-weight codes
This page was built for publication: Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983346)
