Capacity of a Class of Deterministic Relay Channels
From MaRDI portal
Publication:3604468
DOI10.1109/TIT.2007.915921zbMATH Open1311.94036OpenAlexW2110266514MaRDI QIDQ3604468FDOQ3604468
Authors: Younghan Kim
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2007.915921
Recommendations
Cited In (14)
- Approximate Capacity of a Class of Gaussian Interference-Relay Networks
- Anytime Capacity of a Class of Markov Channels
- Capacity bounds and mapping design for binary symmetric relay channels
- Combinatorial structure and capacity of the permuting relay channel
- Title not available (Why is that?)
- The multicast capacity of deterministic relay networks with no interference.
- Relay Channel With Private Messages
- The Capacity of a Relay Channel, Both With and Without Delay
- The Approximate Capacity of the Gaussian $N$-Relay Diamond Network
- Capacity of a Class of Relay Channels With Orthogonal Components
- Uniquely decodable codes for deterministic relay channels
- Ergodic Channel Capacity of an Amplify-and-Forward Relay System at Low SNR in a Generic Noise Environment
- On Achievable Rates for the General Relay Channel
- A Deterministic Algorithm for the Capacity of Finite-State Channels
This page was built for publication: Capacity of a Class of Deterministic Relay Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604468)