A. Grant, B. Rimoldi, R. Urbanke, P. Whiting  Home/Search
Context Related
| belllabs.com/who/ruediger/p...dmmac.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/who/ruediger/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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)
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: Time-Splitting Multiple-Access - Rimoldi (1999) (Correct)
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
[Article contains additional citations not shown here]
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