Bounds and Protocols for a Rate-Constrained Relay Channel

DOI10.1109/TIT.2007.899527zbMATH Open1323.94070OpenAlexW2110757122MaRDI QIDQ3548236FDOQ3548236

Authors: Ashutosh Sabharwal, Urbashi Mitra 

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.899527

Recommendations

• Performance Bounds for Bidirectional Coded Cooperation Protocols
• Communication strategies and coding for relaying
• Bounds on capacity and minimum energy-per-bit for AWGN relay channels
• Capacity of a Class of Relay Channels With Orthogonal Components
• On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Cited In (8)

• Performance bounds for rate envelope multiplexing
• Capacity bounds and mapping design for binary symmetric relay channels
• Tight bounds for FEC-based reliable multicast
• New lower and upper bounds for the competitive ratio of transmission protocols
• Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations
• On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication
• On Achievable Rates for the General Relay Channel
• Buffer-Aided Relaying With Adaptive Link Selection—Fixed and Mixed Rate Transmission

This page was built for publication: Bounds and Protocols for a Rate-Constrained Relay Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548236)