Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions

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 $q$-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

Some resolutions of S(5, 8, 24)

AbstractThere exist 13 mutually disjoint resolutions of the Steiner system S(5, 8, 24). There also exist nine nonisomorphic mutually disjoint resolutions of S(5, 8, 24) where three of the resolutions have the same L2(23) as an automorphism group and the other six have the same affine group C2311 as an automorphism group. A resolution of S(5, 8, 24) using a group of order 21 is displayed and a 13-dimensional Room-type design is mentioned