DocumentCode
3108193
Title
Non-entropic inequalities from information constraints
Author
Ho, Siu-Wai ; Chan, Terence ; Grant, Alex
Author_Institution
Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA, Australia
fYear
2012
fDate
1-6 July 2012
Firstpage
1256
Lastpage
1260
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.
Keywords
entropy; telecommunication security; constrained information inequalities; constrained nonShannon type inequality; information constraints; nonentropic inequalities; random variables; secure communication problems; Cramer-Rao bounds; Decoding; Entropy; Probability distribution; Random variables; Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location
Cambridge, MA
ISSN
2157-8095
Print_ISBN
978-1-4673-2580-6
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2012.6282169
Filename
6282169
Link To Document