Adder MAC and estimates for Rényi entropy

Author(s)
Ajjanagadde, Ganesh; Polyanskiy, Yury
Thumbnail
DownloadPolyanskiy_Adder MAC.pdf (251.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2015-09
URI
http://hdl.handle.net/1721.1/111668
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-1-5090-1824-6
Collections