Abstract
New and simpler achievability proofs that are based on the backward decoding technique are presented for the well-known coding theorems for the multiple-access channel (MAC) with perfect feedback and the degraded relay channel. A class of MACs with different generalized feedback signals is also considered, and achievable-rate regions that are larger than those previously presented in the literature are established.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Decoding methodsMathematical proofChannel (broadcasting)Coding (social sciences)Computer scienceRelayTheoretical computer scienceList decodingAlgorithmChannel codeDiscrete mathematicsMathematicsComputer networkBlock codeStatisticsConcatenated error correction code
Affiliated Institutions
Related Publications
Capacity theorems for the relay channel
A relay channel consists of an input <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x_{l}</tex> , a relay output <tex xmlns:mml="...
Information theoretic considerations for cellular mobile radio
We present some information-theoretic considerations used to determine upper bounds on the information rates that can be reliably transmitted over a two-ray propagation path mob...
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder i...
Multilevel codes and multistage decoding
H. Imai and S. Hirakawa have proposed (1977) a multilevel coding method based on binary block codes that admits a staged decoding procedure. The author extends the coding method...
The discrete memoryless multiple-access channel with cribbing encoders
The capacity regions are determined for various communication situations in which one or both encoders for a multiple access channel crib from the other encoder and learn the ch...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 35
- Issue
- 6
- Pages
- 1160-1165
- Citations
- 68
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
68
OpenAlex
Cite This
Chaolv Zeng,
F. Kuhlmann,
A. Buzo
(1989).
Achievability proof of some multiuser channel coding theorems using backward decoding.
IEEE Transactions on Information Theory
, 35
(6)
, 1160-1165.
https://doi.org/10.1109/18.45272
Identifiers
- DOI
- 10.1109/18.45272