Semideterministic relay networks

An alternative coding scheme is presented for the class of semideterminsitic relay networks, which recovers the noisy network coding inner bound by Lim, Kim, El Gamal, and Chung for this special case.

[1]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[2]  Suhas N. Diggavi,et al.  Wireless Network Information Flow , 2007, ArXiv.

[3]  Mohammad Reza Aref,et al.  Information flow in relay networks , 1981 .

[4]  S. Vishwanath,et al.  Unicast Transmission Over Multiple Access Erasure Networks: Capacity and Duality , 2007, 2007 IEEE Information Theory Workshop.

[5]  Abbas El Gamal,et al.  Capacity theorems for relay channels , 1979 .

[6]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[7]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[8]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[9]  Mohammad Reza Aref,et al.  The capacity of the semideterministic relay channel , 1982, IEEE Trans. Inf. Theory.

[10]  Sae-Young Chung,et al.  Noisy network coding , 2010 .

[11]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[12]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[14]  Gerhard Kramer,et al.  The multicast capacity of deterministic relay networks with no interference , 2006, IEEE Transactions on Information Theory.

[15]  Young-Han Kim,et al.  Capacity of a Class of Deterministic Relay Channels , 2006, 2007 IEEE International Symposium on Information Theory.