(Enter summary)
Abstract: It is shown that the encoding/decoding problem for any asynchronous M-user discrete memoryless
multiple-access channel can be reduced to the corresponding problems for at most 2M \Gamma 1
single-user discrete memoryless channels. This result, which extends a similar result for Gaussian
channels, reduces the seemingly hard task of finding good multiple-access codes to the
much better understood task of finding good codes for single-user channels. As a by-product,
some interesting properties of... (Update)
Context of citations to this paper: More
...region. For a summary of multiple access methods that allow one to approach any point in the capacity region see e.g. the introduction in [8]. The approach used in this paper is related to rate splitting multiple access (see [10] for Gaussian channels and [8] for general...
.... to account for average input constraints are discussed in [66] 121] and [127] Lowcomplexity codes for the MAC are discussed in [70] and [105] It is interesting to note that even for a known MAC, the average probability of error and the maximal probability of error...
Cited by: More
A New Source-Splitting Approach to the Slepian-Wolf Problem - Todd Coleman Anna (2004)
(Correct)
Reliable Communication Under Channel Uncertainty - Lapidoth, Narayan (1998)
(Correct)
Time-Splitting Multiple-Access - Rimoldi (1999)
(Correct)
Active bibliography (related documents): More All
1.1: A Rate-Splitting Approach to the Gaussian Multiple-Access.. - Rimoldi, Urbanke (1995)
(Correct)
0.7: The Asynchronous Capacity Region Of T-Out-Of-M User Codes - Yu-Sun Liu And
(Correct)
0.3: Multi-access Fading Channels - Part II: Delay-Limited Capacities - Hanly, Tse
(Correct)
Similar documents based on text: More All
0.2: Interference Cancellation in Groups - Hanly Whiting Att
(Correct)
0.1: Commitment Capacity of Discrete Memoryless Channels - Winter, Nascimento, Imai (2003)
(Correct)
0.1: Data-Mining-Cup 2004 - Mauser (2004)
(Correct)
Related documents from co-citation: More All
6: IEEE Trans (context) - of, scaling et al. - 1992
3: Wahrscheinlichkeitstheorie verw (context) - entropy, of et al. - 1966
2: Elements of Information Theory (context) - Cover, Thomas - 1991
BibTeX entry: (Update)
A. Grant, B. Rimoldi, R. Urbanke, and P. Whiting, "Rate-splitting multiple access for discrete memoryless channels," IEEE Trans. Inform. Theory, To appear. http://citeseer.ist.psu.edu/grant96ratesplitting.html More
@misc{ grant-ratesplitting,
author = "A. Grant and B. Rimoldi and R. Urbanke and P. Whiting",
title = "Rate-splitting multiple access for discrete memoryless channels",
text = "A. Grant, B. Rimoldi, R. Urbanke, and P. Whiting, Rate-splitting multiple
access for discrete memoryless channels, IEEE Trans. Inform. Theory, To
appear.",
url = "citeseer.ist.psu.edu/grant96ratesplitting.html" }
Citations (may not include all citations):
2319
Elements of Information Theory (context) - Cover, Thomas - 1991
333
Geometric algorithms and combinatorial optimization (context) - Grotschel, Lov'asz et al. - 1993
57
A perspective on multiaccess channels (context) - Gallager - 1985
36
A Basic Course in Algebraic Topology (context) - Massey - 1991
27
A rate-splitting approach to the Gaussian multiple-access ch..
- Rimoldi, Urbanke - 1996
26
An Introduction to Algebraic Topology (context) - Rotman - 1988
23
Foundations of Algebraic Topology (context) - Eilenberg, Steenrod - 1952
18
The collision channel without feedback (context) - Massey, Mathys - 1985
18
Recent results in the Shannon theory (context) - Wyner - 1974
16
Submodular functions, matroids, and certain polyhedra (context) - Edmonds - 1970
15
Cooperative broadcasting (context) - Bergmans, Cover - 1974
11
The capacity region of the totally asynchronous multipleacce.. (context) - Hui, Humblet - 1985
10
Coding for T-user multiple-access channels (context) - Chang, Weldon - 1979
8
Department of Electrical Engineering (context) - Liao, Channels et al. - 1972
7
A class of codes for a T active users out of N multiple-acce.. (context) - Mathys - 1990
5
Constraints on capacity in a multi-user channel
- Hanly, Whiting - 1994
4
New York: Springer-Verlag (context) - Ziegler, Polytopes - 1994
2
the Capacity of Multiple-Terminal Communication Networks (context) - Carleial - 1975
2
Coding for channel with asynchroneous multiple access (context) - Poltyrev - 1983
2
A note on the capacity region of the multi-access channel (context) - Bierbaum, Wallmeier - 1979
1
A coding theory for multiple access channels with correlated.. (context) - Slepian, Wolf - 1973
1
Not known yet (context) - Hanly, Tse - 1995
Documents on the same site (http://cm.bell-labs.com/who/ruediger/pub.html): More
On a Conjecture by McEliece - Urbanke
(Correct)
Packetizing for the Erasure Broadcast Channel with an.. - Urbanke, Wyner (1997)
(Correct)
An Efficient Architecture for Implementation of a Multiplier .. - Soljanin, Urbanke
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC