A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback

DOI10.1109/TIT.2006.878222zbMATH Open1309.94095OpenAlexW1985441670MaRDI QIDQ3547912FDOQ3547912

Shraga I. Bross

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.2006.878222

Mathematics Subject Classification ID

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

Cited In (2)

• Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations
• On the Discrete Memoryless Partially Cooperative Relay Broadcast Channel and the Broadcast Channel With Cooperating Decoders

Recommendations

• On the converse to the coding theorem for discrete memoryless channels (Corresp.) 👍 👎
• The feedback capacity region of a class of discrete memoryless multiple access channels (Corresp.) 👍 👎
• Partial feedback for the discrete memoryless multiple access channel (Corresp.) 👍 👎
• On the Relay Channel With Receiver–Transmitter Feedback 👍 👎
• On the Reliability Function of the Discrete Memoryless Relay Channel 👍 👎
• On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback 👍 👎
• Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations 👍 👎
• Optimal Memoryless Relays With Noncoherent Modulation 👍 👎
• Communicating Over Filter-and-Forward Relay Networks With Channel Output Feedback 👍 👎
• On the Discrete Memoryless Partially Cooperative Relay Broadcast Channel and the Broadcast Channel With Cooperating Decoders 👍 👎

This page was built for publication: A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback

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