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

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

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. 👍 👎
• On optimal superimposed codes 👍 👎
• Bounds and algorithms for generalized superimposed codes 👍 👎
• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form 👍 👎
• Superposition Coding Is Almost Always Optimal for the Poisson Broadcast Channel 👍 👎
• The $K$ -User Vector Gaussian Multiple-Access Channel With General Messages Sets: Capacity, Polymatroidal Structure, and Efficient Computation 👍 👎
• Generalized Partial Orders for Polar Code Bit-Channels 👍 👎

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)