Capacity of a Class of Relay Channels With Orthogonal Components
From MaRDI portal
Recommendations
- Capacity of a Class of Deterministic Relay Channels
- The Capacity of a Relay Channel, Both With and Without Delay
- Cooperative Strategies and Capacity Theorems for Relay Networks
- Bounds on capacity and minimum energy-per-bit for AWGN relay channels
- A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback
Cited in
(12)- Broadcast diamond channel: transmission strategies and bounds
- Strong converse theorems for multimessage networks with tight cut-set bound
- Bounds on capacity and minimum energy-per-bit for AWGN relay channels
- On the Capacity of Large Gaussian Relay Networks
- Degraded Gaussian Multirelay Channel: Capacity and Optimal Power Allocation
- Bounds and Protocols for a Rate-Constrained Relay Channel
- Relay Channel With Private Messages
- The Capacity of a Relay Channel, Both With and Without Delay
- Capacity of a Class of Deterministic Relay Channels
- Combinatorial structure and capacity of the permuting relay channel
- Capacity bounds and mapping design for binary symmetric relay channels
- Capacity Analysis For Orthogonal Halftone Orientation Modulation Channels
This page was built for publication: Capacity of a Class of Relay Channels With Orthogonal Components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546905)