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

DOI10.1109/18.945256zbMath1021.94516OpenAlexW2151434061MaRDI QIDQ4544680

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

zbMATH Keywords

multiple accesssuccessive decodingasynchronous capacity regiondominant face

Mathematics Subject Classification ID

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

Related Items (1)

On Capacity Regions of Discrete Asynchronous Multiple Access Channels

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