Skip to main content
Have a personal or library account? Click to login
Compress-and-Forward for Relay Broadcast Channels without Common Messages Cover

Compress-and-Forward for Relay Broadcast Channels without Common Messages

Cybernetics and Information Technologies
Volume 15 (2015): Issue 2 (June 2015)
By:  and    
Open Access
|Jul 2015
References

References

  1. 1. Van der Meulen, E. C. Three-Terminal Communication Channels. - Adv. Appl. Probab, Vol. 3, 1971, pp. 120-154.
    Open DOISearch in Google Scholar
  2. 2. Cover, T., A. E. Gamal. Capacity Theorems for the Relay Channel. - IEEE Trans. Inf.Theory, Vol. 25, 1979, No 5, pp. 572-584.
    Open DOISearch in Google Scholar
  3. 3. Tannious, R., A. Nosratinia. Relay Channel with Private Messages. - IEEE Trans. Inf. Theory, Vol. 53, 2007, No 10, pp. 572-584.
    Open DOISearch in Google Scholar
  4. 4. Kramer, G., M. Gastpar, P. Gupta. Cooperative Strategies and Capacity Theorems for Relay Networks. - IEEE Trans. Inf. Theory, Vol. 51, 2005, No 9, pp. 3037-3063.
    Open DOISearch in Google Scholar
  5. 5. Cover, T. M., J. A. Thomas. Elements of Information Theory. Second Ed. John Wiley & Sons, 2006.
    Search in Google Scholar
  6. 6. Sendonaris, A., E. Erkip, B. Aazhang. User Cooperation Diversity. Part II. Implementation Aspects and Performance Analysis. - IEEE Trans. Commun., Vol. 51, 2003, No 11, pp. 1939-1948.
    Open DOISearch in Google Scholar
  7. 7. Laneman, J. N., D. N. C. Tse, G. W. Wornell. Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behaviour. - IEEE Trans. Inf. Theory, Vol. 50, 2004, No 12, pp. 3062-3080.
    Open DOISearch in Google Scholar
  8. 8. Li, Y. A Decode-and-Forward Strategy for Broadcast Relay Channel without Common Messages. - AEIT’2011, 2011.
    Search in Google Scholar
  9. 9. Song, X., Y. Li. An Achievable Rate Region for Relay Multiple Access Channel Based on Decode-and-Forward. - Sensors & Transducers, Vol. 159, 2013, No 11, pp. 155-159.
    Search in Google Scholar
  10. 10. Liang, Y., V. V. Veeravalli. Cooperative Relay Broadcast Channels. - IEEE Trans. Inf. Theory, Vol. 53, 2007, No 3, pp. 900-928.
    Open DOISearch in Google Scholar
  11. 11. Liang, Y., G. Kramer. Rate Regions for Relay Broadcast Channels. - IEEE Trans. Inf. Theory, Vol. 53, 2007, No 10, pp. 3517-3535.
    Open DOISearch in Google Scholar
  12. 12. Willems, F. M. J. Information Theoretical Results for the Discrete Memoryless Multiple Access Channel. PhD Thesis, Leuven, Belgium, Katholieke Universiteit, 1982.
    Search in Google Scholar
  13. 13. Cover, T. M., J. A. Thomas. Elements of Information Theory. New York, Wiley, 1991.
    Open DOISearch in Google Scholar
  14. 14. El Gamal, A, A., E. C. van der Meulen. A Proof of Marton’s Coding Theorem for the Discrete Memoryless Broadcast Channel. - IEEE Trans. Inf. Theory, Vol. 27, 1981, No 1, pp. 120-122.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.1515/cait-2015-0031 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702 (formerly 1314-4081)
Journal RSS Feed
Language: English
Page range: 97 - 110
Published on: Jul 3, 2015
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Keywords:
Relay broadcast channels,
relay channels,
broadcast channels,
achievable rate region,
compress-and-forward
Related subjects:
Computer sciences,
Information technology

© 2015 Xiaoxia Song, Yong Li, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Volume 15 (2015): Issue 2 (June 2015)
Previous article
Next article