On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback

@article{Heidari2018OnTR,
  title={On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback},
  author={Mohsen Heidari and Achilleas Anastasopoulos and Sandeep S. Pradhan},
  journal={2018 IEEE Information Theory Workshop (ITW)},
  year={2018},
  pages={1-5}
}
We derive a lower and upper bounds on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the point-to-point case. Also, we adopt the techniques used to prove the converse for the feedback-capacity of MAC. For the lower-bound on the error exponent, we present a coding scheme consisting of a data and a confirmation stage. In the data stage, any… 
1 Citations

Figures from this paper

Upper Bounds on the Feedback Error Exponent of Channels With States and With Memory

This paper derives an upper bound on the feedback error exponent and the feedback capacity with variable length codes (VLCs) and describes a stochastic process defined based on the entropy of the message given the past channel’s outputs.

References

SHOWING 1-10 OF 13 REFERENCES

On the necessity of structured codes for communications over MAC with feedback

It is shown that any optimality achieving scheme for this example must have a specific algebraic structure, and particularly, the codebooks must be closed under binary addition.

A Simple Converse of Burnashev's Reliability Function

This work provides a converse that parallels the Yamamoto-Itoh achievability construction and suggests that a communication and a confirmation phase are implicit in any scheme for which the probability of error decreases with the largest possible exponent.

A coding scheme for additive noise channels with feedback-I: No bandwidth constraint

This paper presents a coding scheme that exploits the feedback to achieve considerable reductions in coding and decoding complexity and delay over what would be needed for comparable performance with the best known (simplex) codes for the one-way channel.

Error exponent of the common-message broadcast channel with variable-length feedback

  • Lan V. TruongV. Tan
  • Computer Science
    2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
We derive upper and lower bounds on the reliability function for the discrete memoryless broadcast channel with common message and variable-length feedback. We show that the bounds are tight when the

The zero error capacity of a noisy channel

  • C. Shannon
  • Computer Science
    IRE Trans. Inf. Theory
  • 1956
It is shown that while the ordinary capacity of a memoryless channel with feedback is equal to that of the same channel without feedback, the zero error capacity may be greater and a solution is given to the problem of evaluating C_oF.

The capacity region of a multiple-access discrete memoryless channel can increase with feedback (Corresp.)

The capacity of a single-input single-output discrete memoryless channel is not increased by the use of a noiseless feedback link, but the capacity region for such a channel is enlarged if a noisy feedback link is utilized.

Asymptotic performance of a modified Schalkwijk-Barron scheme for channels with noiseless feedback (Corresp.)

A modified Schalkwijk-Barron transmission scheme is presented for channels with noiseless feedback and the new result obtained shows that the modified scheme also attains high reliability functions for DMC's.

A perspective on multiaccess channels

The information theoretic approach and the collision resolution approach to multiaccess channels are reviewed in terms of the underlying communication problems that both are modeling. Some

Directed information for channels with feedback

The feedback capacity region of a class of discrete memoryless multiple access channels

  • F. Willems
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1982
The capacity region of a class of discrete memoryless multiple access channels with feedback is determined, including as a special case the channel considered by Gaarder and Wolf.