Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
Information Theory
2014-01-17 v1 Combinatorics
math.IT
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.
Keywords
Cite
@article{arxiv.1401.3928,
title = {Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions},
author = {Yeow Meng Chee and Zouha Cherif and Jean-Luc Danger and Sylvain Guilley and Han Mao Kiah and Jon-Lark Kim and Patrick Solé and Xiande Zhang},
journal= {arXiv preprint arXiv:1401.3928},
year = {2014}
}