Name
Abstract | ||
|---|---|---|
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatorial constructions for the MCWCs, which yield several new infinite families of optimal MCWCs. Furthermore, we demonstrate that the Johnson-type upper bounds of the MCWCs are asymptotically tight for fixed Hamming weights and distances. Finally, we provide bounds and constructions of the 2-D MCWCs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIT.2017.2690450 | IEEE Trans. Information Theory |
Keywords | Field | DocType |
Upper bound,Hamming weight,Binary codes,Electronic mail,Reliability theory,Indexes | Hamming code,Discrete mathematics,Combinatorics,Hamming(7,4),Block code,Hamming distance,Linear code,Physical unclonable function,Mathematics | Journal |
Volume | Issue | ISSN |
abs/1411.2513 | 6 | 0018-9448 |
Citations | PageRank | References |
4 | 0.44 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yeow Meng Chee | 1 | 593 | 62.01 |
| Han Mao Kiah | 2 | 128 | 29.10 |
| Hui Zhang 0004 | 3 | 9 | 1.23 |
| Xiande Zhang | 4 | 52 | 15.19 |