Name
Abstract | ||
|---|---|---|
This paper investigates a new method in proving converses in secure communication problems. The method gives a converse result in terms of the logarithm of support size instead of entropy. The results are connected to constrained information inequalities involving three random variables. A new constrained non-Shannon type inequality is shown. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ISIT.2012.6282169 | ISIT |
Keywords | Field | DocType |
random variables,information constraints,constrained nonshannon type inequality,nonentropic inequalities,constrained information inequalities,secure communication problems,telecommunication security,entropy,security,decoding,probability distribution | Bernstein inequalities,Entropy power inequality,Converse,Discrete mathematics,Combinatorics,Mathematical optimization,Binary entropy function,Joint entropy,Mutual information,Conditional entropy,Logarithm,Mathematics | Conference |
ISSN | ISBN | Citations |
2157-8095 E-ISBN : 978-1-4673-2578-3 | 978-1-4673-2578-3 | 1 |
PageRank | References | Authors |
0.41 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siu-Wai Ho | 1 | 195 | 26.35 |
| Terence Chan | 2 | 135 | 22.21 |
| Alex J. Grant | 3 | 748 | 61.08 |