An outer bound on the capacity region of Broadcast-Relay-Channel

Salehkalaibar, Sadaf; Ghabeli, Leila; Aref, Mohammad Reza

doi:10.1109/isit.2010.5513534

2010 IEEE International Symposium on Information Theory 2010

DOI: 10.1109/isit.2010.5513534

|View full text |Cite

An outer bound on the capacity region of Broadcast-Relay-Channel

Sadaf Salehkalaibar

Leila Ghabeli

Mohammad Reza Aref

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

2013

Publication Types

Select...

Other2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result is extented to the K-destinations case in [6]. Finally, [7] derives an outer bound on the capacity region of the BRC. Another outer bound is due to [8].…”

mentioning

confidence: 86%

Cooperative broadcasting with successive refinement based compression

Yildinm

Yüksel

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

As a new achievability scheme, successive refinement coding based compress-and-forward relaying (sCF) is proposed for both discrete memoryless and Gaussian broadcast relay channels (BRC) with one source, two destinations and a dedicated relay. A new outer bound is also provided on the capacity region of physically degraded BRC. Then, the achievability scheme is extended to K-destinations. For the Gaussian BRC, it is shown that the sCF rate region outperforms other CF schemes in the literature. Finally, it is proved that the new achievable scheme is within a half bit of the outer bound on the capacity region for a subset of channel gains.978-1-4799-0446-4/13/$31.00

show abstract

“…This result is extented to the K-destinations case in [6]. Finally, [7] derives an outer bound on the capacity region of the BRC. Another outer bound is due to [8].…”

mentioning

confidence: 86%

Cooperative broadcasting with successive refinement based compression

Yildinm

Yüksel

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

Multiple description coding based compress-and-forward for the broadcast relay channel

Yildirim

Yüksel

2012

2012 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

An outer bound on the capacity region of Broadcast-Relay-Channel

Cited by 2 publications

References 11 publications

Cooperative broadcasting with successive refinement based compression

Cooperative broadcasting with successive refinement based compression

Multiple description coding based compress-and-forward for the broadcast relay channel

Contact Info

Product

Resources

About