Adder MAC and estimates for Rényi entropy
Name
Polyanskiy_Adder MAC.pdf
Size
251.32 KB
Format
Adobe PDF
Checksum (MD5)
b8c80c15ddec3e47e19a0be51ef9e300
Author(s)
Ajjanagadde, Ganesh
Polyanskiy, Yury
Date Issued
September 2015
Journal
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ajjanagadde, Ganesh, and Polyanskiy, Yury. “Adder MAC and Estimates for Rényi Entropy.” 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), September 29 - October 2, Monticello, Illinois, USA, Institute of Electrical and Electronics Engineers (IEEE), September 2015: 434-441 © 2015 Institute of Electrical and Electronics Engineers (IEEE)
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2015.7447036
