Generalized time sharing: a low-complexity capacity-achieving multiple-access technique

DOI10.1109/18.945256zbMATH Open1021.94516OpenAlexW2151434061MaRDI QIDQ4544680FDOQ4544680

Authors: Bixio Rimoldi 

Publication date: 4 August 2002

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

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

Recommendations

• Rate-splitting multiple access for discrete memoryless channels
• A rate-splitting approach to the Gaussian multiple-access channel
• On the capacity of the asynchronous T-user M-frequency noiseless multiple-access channel without intensity information
• On capacity regions of discrete asynchronous multiple access channels
• Multiple-access channels with memory with and without frame synchronism

zbMATH Keywords

multiple accessasynchronous capacity regiondominant facesuccessive decoding

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited In (4)

• The capacity region of the symbol-asynchronous Gaussian multiple-access channel
• On capacity regions of discrete asynchronous multiple access channels
• Offset Encoding for Multiple-Access Relay Channels
• Rate-splitting multiple access for discrete memoryless channels

This page was built for publication: Generalized time sharing: a low-complexity capacity-achieving multiple-access technique

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