Network coding for line networks with broadcast channels
From MaRDI portal
Summary: An achievable rate region for line networks with edge and node capacity constraints and broadcast channels (BCs) is derived. The region is shown to be the capacity region if the BCs are orthogonal, deterministic, physically degraded, or packet erasure with one-bit feedback. If the BCs are physically degraded with additive Gaussian noise then independent Gaussian inputs achieve capacity.
Recommendations
Cites work
- A proof of Marton's coding theorem for the discrete memoryless broadcast channel (Corresp.)
- Broadcast channels
- Capacity results for the discrete memoryless network
- Network Coding in Node-Constrained Line and Star Networks
- Noisy Network Coding
- On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback
- Rate Regions for Relay Broadcast Channels
- The capacity of the white Gaussian multiple access channel with feedback
- The feedback capacity of degraded broadcast channels (Corresp.)
- Wireless Network Information Flow: A Deterministic Approach
Cited in
(10)- Binary linear programming models for robust broadcasting in communication networks
- On networks of two-way channels
- Towards an information theory of large networks: an achievable rate region
- A Random Linear Network Coding Approach to Multicast
- Network Coding Capacity With a Constrained Number of Coding Nodes
- Feedback-Based Online Network Coding
- scientific article; zbMATH DE number 2135149 (Why is no real title available?)
- Achieving net feedback gain in the linear-deterministic butterfly network with a full-duplex relay
- Variable-Rate Linear Network Coding
- Complex Linear Physical-Layer Network Coding
This page was built for publication: Network coding for line networks with broadcast channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406171)
