Bounds on capacity and minimum energy-per-bit for AWGN relay channels

By Abbas A. El Gamal, Mehdi Mohseni, Sina Zahedi. IEEE Transactions on Information Theory, 2006

300 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/336af39ac207b9ac968dcef3b75cddb210c36ef1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Abbas A. El Gamal
2. Ayfer Özgür
3. David Tse
4. Sung Hoon Lim
5. Sae-Young Chung
6. Young-Han Kim
7. Syed Ali Jafar
8. Nihar Jindal

In Electrical and Electronic Engineering

1. Abbas A. El Gamal
2. Ayfer Özgür
3. David Tse
4. Sung Hoon Lim
5. Sae-Young Chung
6. Olivier Lévêque
7. Young-Han Kim
8. Syed Ali Jafar

Citations in the corpus

• Noisy Network Coding (2010, background): “Around the same time, El Gamal, Mohseni, and Zahedi [15] put forth the equivalent characterization of the compress–forward lower bound C ≥ max p(x1)p(x2)p(ŷ2|y2,x2) min{I(X1; Ŷ2, Y3|X2), I(X1,X2;Y3)− I(Y2; Ŷ2|X1,X2, Y3)}.”
• Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks (2006, background): “(The idea of using burstiness in improving the low-SNR performance of relay networks was introduced in [14] in the context of single-relay networks.”