DocumentCode
3766015
Title
Adder MAC and estimates for Rényi entropy
Author
Ganesh Ajjanagadde;Yury Polyanskiy
Author_Institution
Department of EECS, MIT, Cambridge, MA, 02139, USA
fYear
2015
Firstpage
434
Lastpage
441
Abstract
This paper discusses a possible program for improving the outer (converse) bounds on the finite-blocklength performance of multiple-access codes. The program is based on a certain conjecture involving Rényi entropy of a sum of two independent binary vectors. Some partial results towards showing the conjecture are presented. The problem of bounding the joint Rényi entropy in terms of the marginal entropies is addressed.
Keywords
"Adders","Entropy","Encoding","Standards","Electronic mail","Measurement uncertainty","Interference"
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on
Type
conf
DOI
10.1109/ALLERTON.2015.7447036
Filename
7447036
Link To Document