A Unifying Order-Theoretic Framework for Superposition Coding: Polymatroidal Structure and Optimality in the Multiple-Access Channel With General Message Sets

DOI10.1109/TIT.2016.2610436zbMATH Open1359.94441OpenAlexW2519141893MaRDI QIDQ2979072FDOQ2979072

Authors: Henry P. Romero, Mahesh K. Varanasi 

Publication date: 2 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2016.2610436

Recommendations

• The $K$ -User Vector Gaussian Multiple-Access Channel With General Messages Sets: Capacity, Polymatroidal Structure, and Efficient Computation
• Bounds and algorithms for generalized superimposed codes
• On optimal superimposed codes
• Generalized Partial Orders for Polar Code Bit-Channels
• Superposition Coding Is Almost Always Optimal for the Poisson Broadcast Channel
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• scientific article; zbMATH DE number 1947404
• scientific article; zbMATH DE number 2154117
• Superadditivity of multiple access Gaussian channels
• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

This page was built for publication: A Unifying Order-Theoretic Framework for Superposition Coding: Polymatroidal Structure and Optimality in the Multiple-Access Channel With General Message Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979072)