Two-way Channel In Information Theory

Firstly, an introduction of two-way communications channel is given. Then Shannon’s inner and outer bounds are introduced. Upon Shannon’s bounds, tighter lower and upper bounds are found for general discrete memoryless two-way channels. After that, the capacity regions of some specific two-way channels are discussed. Finally, a summary is given.

[1]  Gerhard Kramer,et al.  On the separation of channel and network coding in aref networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  Michael Gastpar,et al.  Achievable rates for conferencing multiway channels , 2008, 2008 IEEE International Symposium on Information Theory.

[3]  Edward C. van der Meulen,et al.  A survey of multi-way channels in information theory: 1961-1976 , 1977, IEEE Trans. Inf. Theory.

[4]  Frederick Jelinek,et al.  Coding for and decomposition of two-way channels , 1964, IEEE Trans. Inf. Theory.

[5]  Hb Erik Meeuwissen.  Information theoretical aspects of two-way communication , 1998 .

[6]  Andries P. Hekstra,et al.  Dependence balance bounds for single-output two-way channels , 1989, IEEE Trans. Inf. Theory.

[7]  Toby Berger,et al.  New outer bounds to capacity regions of two-way channels , 1986, IEEE Trans. Inf. Theory.

[8]  Te Sun Han,et al.  A general coding scheme for the two-way channel , 1984, IEEE Trans. Inf. Theory.

[9]  Armin Wittneben,et al.  Achievable Rate Regions for the Two-way Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[10]  H. B. Meeuwissen,et al.  A 2-D weighing procedure for two-way communication , 1997, Proceedings of IEEE International Symposium on Information Theory.

[11]  E. A. Haroutunian,et al.  Restricted two-way channel: bounds for achievable rates region for given error probability exponents , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[12]  Serap A. Savari,et al.  Cut sets and information flow in networks of two-way channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[13]  J. Pieter M. Schalkwijk,et al.  The binary multiplying channel--A coding scheme that operates beyond Shannon's inner bound region , 1982, IEEE Trans. Inf. Theory.

[14]  J. Pieter M. Schalkwijk.  On an extension of an achievable rate region for the binary multiplying channel , 1983, IEEE Trans. Inf. Theory.

[15]  Gerhard Kramer.  Capacity results for the discrete memoryless network , 2003, IEEE Trans. Inf. Theory.

[16]  Claude E. Shannon,et al.  Two-way Communication Channels , 1961 .

[17]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[18]  H. B. Meeuwissen,et al.  Semi-feedback for the binary multiplying channel , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[19]  E.C. van der Meulen,et al.  An Asymptotic Expression For The Capacity Region Of The Two-way Communication Channel With Additive Almost Gaussian Noise , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[20]  Ender Tekin,et al.  Achievable Rates for Two-Way Wire-Tap Channels , 2007, 2007 IEEE International Symposium on Information Theory.