ProbXiv
Explorersign in
Problem archiveProblem record

Statement

We propose efficient coding schemes based on random linear models with approximate message passing (AMP) decoding, and study the tradeoff between energy-per-bit and achievable user density for a fixed target error rate. Open problems: This work discussed achievable regions and converse bounds for the Gaussian multiple-access channel in the ‘many-user’ regime, where the number of users grows proportionally to the code length. A natural open problem is to this close this gap by obtaining improved bounds in both directions. Another open problem is to obtain inner and outer bounds for the problem when practical constraints such as random access are included. Near-Optimal Coding for Many-User Multiple Access Channels Ramji Venkataraman (joint work with Kuan Hsieh, Cynthia Rush)

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.