Name
Abstract | ||
|---|---|---|
The function M(m, n, d, w), the largest size of an unrestricted binary code made of m by n arrays, with constant row weight w, and minimum distance d is introduced and compared to the classical functions of combinatorial coding theory Aq(n, d) and A(n, d, w). The analogues for systematic codes of A(n, d) and A(n, d, w) are introduced apparently for the first time. An application to the security of embedded systems is given: these codes happen to be efficient challenges for physically unclonable functions. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISIT.2013.6620237 | Information Theory Proceedings |
Keywords | Field | DocType |
binary codes,embedded systems,security of data,combinatorial coding theory,embedded systems security,multiply constant weight codes,physically unclonable functions,systematic codes,unrestricted binary code,PUFs,constant weight code,doubly constant weight codes,multiply constant weight codes | Discrete mathematics,Combinatorics,Concatenated error correction code,Group code,Luby transform code,Block code,Expander code,Coding theory,Linear code,Reed–Muller code,Mathematics | Conference |
ISSN | Citations | PageRank |
2157-8095 | 1 | 0.37 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zouha Cherif | 1 | 33 | 3.15 |
| Jean-Luc Danger | 2 | 794 | 83.57 |
| Sylvain Guilley | 3 | 214 | 15.47 |
| Jon-Lark Kim | 4 | 312 | 34.62 |
| Patrick Solé | 5 | 636 | 89.68 |