Abstract

p(u)p(x,~u)p(x~~u)p(ylxl,x~), is established for the multiple-access channel with feedback. Time sharing of these achievable rates yields the rate region of this paper. This region generally exceeds the achievable rate region without feedback and exceeds the rate point found by Gaarder and Wolf for the binary erasure multiple-access channel with feedback. The presence of feedback allows the independent transmitters to understand each other’s intended transmissions before the receiver has sufficient information to achieve the desired decoding. This allows the transmitters to cooperate in the transmission of information that resolves the residual uncertainty of the receiver. At the same time, independent information from the transmitters is superimposed on the cooperative correction information. The proof involves list codes and block Markov encoding. G I.

Keywords

Decoding methodsChannel (broadcasting)Binary numberInformation transmissionBinary erasure channelTransmitterTransmission (telecommunications)AlgorithmErasureMarkov chainBlock (permutation group theory)Computer scienceEncoding (memory)CombinatoricsDiscrete mathematicsMathematicsStatisticsTelecommunicationsComputer networkChannel capacityArtificial intelligenceArithmetic

Affiliated Institutions

Related Publications

Publication Info

Year
1981
Type
article
Volume
27
Issue
3
Pages
292-298
Citations
270
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

270
OpenAlex

Cite This

Thomas M. Cover, Cyril Leung (1981). An achievable rate region for the multiple-access channel with feedback. IEEE Transactions on Information Theory , 27 (3) , 292-298. https://doi.org/10.1109/tit.1981.1056357

Identifiers

DOI
10.1109/tit.1981.1056357