Capacity bounds and mapping design for binary symmetric relay channels

DOI10.3390/E14122589zbMath1314.94048OpenAlexW1995038875MaRDI QIDQ406244

Mikael Skoglund, Majid Nasiri Khormuji

Publication date: 8 September 2014

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e14122589

zbMATH Keywords

binary Fourier transformbinary symmetric relay channelcapacity boundscompress-and-forwarddecode-and-forwardlinear relaying

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Performance of quantizers on noisy channels using structured families of codes
• Bounds on capacity and minimum energy-per-bit for AWGN relay channels
• Capacity Bounds and Power Allocation for Wireless Relay Channels
• Cooperative Strategies and Capacity Theorems for Relay Networks
• Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
• On the Role of Estimate-and-Forward With Time Sharing in Cooperative Communication
• Capacity theorems for the relay channel
• The capacity of the semideterministic relay channel (Corresp.)
• On channel-constrained vector quantization and index assignment for discrete memoryless channels
• Capacity of a Class of Modulo-Sum Relay Channels
• On Instantaneous Relaying
• Three-terminal communication channels

This page was built for publication: Capacity bounds and mapping design for binary symmetric relay channels