Coding in an asynchronous multiple-access channel

MaRDI QIDQ800291zbMATH OpenFDO

Authors G. Sh. Poltyrev

Publication date 1983

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

asynchronous multiple- accesscapacity regiondiscrete memoryless channeltrellis codesViterbi's decoding algorithm

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Communication theory (94A05) Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Review text

The paper deals with the determination of the capacity region for a discrete memoryless channel with asynchronous multiple-access. This channel is specified by the transition probability matrix. Messages generated by two independent, memoryless sources are encoded by codes \(G_ 1\) and \(G_ 2\), respectively. The sources are stationary and the codes \(G_ 1\) and \(G_ 2\) have length n and rates \(R_ 1\) and \(R_ 2\). Using the mutual information, calculated on the basis of the transition probabilities and the message distribution, the author gives the converse encoding theorem for the asynchronous multiple-access channel (MAC). He proves that the capacity region is described by the convex closure of the set of the code rates. Next, the author gives an upper bound for the decoding-error probability for trellis codes in the case of Viterbi's decoding algorithm. In such a case the code sequences at the MAC input can be described by the trellis diagram. The author defines the set of all incorrect paths of length 1 in the trellis diagram. For these paths the probabilities of erroneous maximum-likelihood decoding of a block code are given.

Recommendations

• Decoding of the trellis codes in a linear asynchronous multiple access channel
• On capacity regions of discrete asynchronous multiple access channels
• Rate-splitting multiple access for discrete memoryless channels
• Coding for a multiple-access channel
• Multiple-access channels with memory with and without frame synchronism

Cited in

(14)

• Decoding of the trellis codes in a linear asynchronous multiple access channel
• scientific article; zbMATH DE number 3865145 (Why is no real title available?)
• scientific article; zbMATH DE number 3875135 (Why is no real title available?)
• Robust coding for multiple-access channels
• Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users
• Multiple-access channels with memory with and without frame synchronism
• scientific article; zbMATH DE number 3693146 (Why is no real title available?)
• Asynchronous multiple source network coding for wireless broadcasting
• scientific article; zbMATH DE number 721892 (Why is no real title available?)
• scientific article; zbMATH DE number 1779569 (Why is no real title available?)
• Rate-splitting multiple access for discrete memoryless channels
• A Note on Parallel Asynchronous Channels With Arbitrary Skews
• On capacity regions of discrete asynchronous multiple access channels
• Coding for a multiple access OR channel: A survey

This page was built for publication: Coding in an asynchronous multiple-access channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800291)