Name
Abstract | ||
|---|---|---|
This paper studies the security performance of random codes in the syndrome coding scheme. We propose theoretical analysis using a putative (n, k) code having the same distribution of syndrome probabilities as the ensemble of all (n, k) random codes to calculate the average equivocation of random codes, and compare the theoretical results with the simulation results generated from Monte Carlo analysis which shows that the theoretical method is precise. Moreover the analysis works well for long codes having large values of n - k, which are not amenable to Monte Carlo analysis. We present results showing that the longer the length of the code the higher the value of the average equivocation and the lower the value of the standard deviation of the equivocation. For code lengths in excess of 150 bits or so almost any random code will produce high levels of secrecy. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICT.2014.6845078 | ICT |
Keywords | Field | DocType |
syndrome coding,linear binary codes,linear codes,encoding,monte carlo methods,monte carlo analysis,binary codes,vectors,channel coding,probability,security | Discrete mathematics,Hamming code,Concatenated error correction code,Combinatorics,Low-density parity-check code,Turbo code,Block code,Expander code,Real-time computing,Linear code,Mathematics,Variable-length code | Conference |
Citations | PageRank | References |
1 | 0.40 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ke Zhang | 1 | 6 | 1.64 |
| Martin Tomlinson | 2 | 106 | 19.89 |
| mohammed zaki ahmed | 3 | 16 | 6.01 |