Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 52 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4 30 tok/s Pro
2000 character limit reached

Structured Mappings and Conferencing Common Information for Multiple-access Channels (1905.04760v1)

Published 12 May 2019 in cs.IT and math.IT

Abstract: In this work, we study two problems: three-user Multiple-Access Channel (MAC) with correlated sources, and MAC with Feedback (MAC-FB) with independent messages. For the first problem, we identify a structure in the joint probability distribution of discrete memoryless sources, and define a new common information called ``conferencing common information". We develop a multi-user joint-source channel coding methodology based on structured mappings to encode this common information efficiently and to transmit it over a MAC. We derive a new set of sufficient conditions for this coding strategy using single-letter information quantities for arbitrary sources and channel distributions. Next, we make a fundamental connection between this problem and the problem of communication of independent messages over three-user MAC-FB. In the latter problem, although the messages are independent to begin with, they become progressively correlated given the channel output feedback. Subsequent communication can be modeled as transmission of correlated sources over MAC. Exploiting this connection, we develop a new coding scheme for the problem. We characterize its performance using single-letter information quantities, and derive an inner bound to the capacity region. For both problems, we provide a set of examples where these rate regions are shown to be optimal. Moreover, we analytically prove that this performance is not achievable using random unstructured random mappings/codes.

Citations (2)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube