%0 Generic %1 citeulike:14041963 %A Chee, Yeow M. %A Cherif, Zouha %A Danger, Jean-Luc %A Guilley, Sylvain %A Kiah, Han M. %A Kim, Jon-Lark %A Solé, Patrick %A Zhang, Xiande %D 2014 %J arXiv.org > Computer Science > Information Theory %K 94b05-linear-codes-general 94a60-cryptography %N 3928 %T Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions %U http://arxiv.org/abs/1401.3928 %V 1401 %X 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.

@misc{citeulike:14041963, 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 \$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.}}, added-at = {2017-06-29T07:13:07.000+0200}, archiveprefix = {arXiv}, author = {Chee, Yeow M. and Cherif, Zouha and Danger, Jean-Luc and Guilley, Sylvain and Kiah, Han M. and Kim, Jon-Lark and Sol\'{e}, Patrick and Zhang, Xiande}, biburl = {https://www.bibsonomy.org/bibtex/2cd2d758bc47c2129c3c88d217dd39df6/gdmcbain}, citeulike-article-id = {14041963}, citeulike-linkout-0 = {http://arxiv.org/abs/1401.3928}, citeulike-linkout-1 = {http://arxiv.org/pdf/1401.3928}, day = 16, eprint = {1401.3928}, interhash = {d3c5b7ce754a335e80e1bd9d407ec5b7}, intrahash = {cd2d758bc47c2129c3c88d217dd39df6}, journal = {arXiv.org > Computer Science > Information Theory}, keywords = {94b05-linear-codes-general 94a60-cryptography}, month = jan, number = 3928, posted-at = {2016-05-26 06:47:51}, priority = {2}, timestamp = {2019-05-13T06:20:52.000+0200}, title = {{Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions}}, url = {http://arxiv.org/abs/1401.3928}, volume = 1401, year = 2014 }