scientific article; zbMATH DE number 3438733
Channels with several senders and one receiver are introduced and a single letter characterization of the capacity region is obtained. Those channels have subsequently been called ``multiple-access channels in the literature. Since this paper was presented a very rapid development has started in the Shannon theory of sources and channels with several encoders and decoders. Some of the results were also obtained more than a year later by \textit{H. Liao} [``A coding theorem for multiple access communication presented at the 1972 International Symposium on Information Theory, Asilomar (1972)]. An interesting generalization to certain correlated sources is due to \textit{D. Slepian} and \textit{J. WoIf} [Bell Syst. Tech. J. 52, 1037--1076 (1973; ZbI 0273.94010)]. In ``The capacity region of a channel with two senders and two receivers (to appear in [Ann. Probab. 2, 805--814 (1974; Zbl 0317.94023)]) the present author extended the Shannon theory to the case of 2 senders, both sending independent messages to both receivers. Subsequently \textit{M. Ulrey} removed in his Ph. D. thesis the restriction to 2 senders and receivers (to appear in [Inf. Control 29, 185--203 (1975; Zbl 0324.94014)]). [For the entire collection see Zbl 0267.00028.]
- \(M\)-matrices and bounds for reliable transmission of information in communication systems and economic markets
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds
- A Strong Converse Theorem for Quantum Multiple Access Channels
- Estimates of E-capacity and capacity regions for Multiple-access Channel With Random Parameter
- Bridging the gap between information theory and wireless networking
- Every bad code has a good subcode: A local converse to the coding theorem
- Elimination of correlation in random codes for arbitrarily varying channels
- On the near-optimality of one-shot classical communication over quantum channels
- On capacity regions of discrete asynchronous multiple access channels
- Coding and capacity calculation for the \(\mathcal{T}\)-user \(F\)-adder channel
- Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
- Unsourced random access
- General theory of information transfer: Updated
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404773)