Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels
Jaemin Han, Chih-Chun Wang

TL;DR
This paper analyzes the capacity region of a smart repeater network with broadcast erasure channels using linear network coding, introducing new coding strategies and bounds that closely approximate the true capacity.
Contribution
It develops new inner and outer bounds for the LNC capacity region, incorporating advanced coding operations beyond traditional XOR methods.
Findings
Proposed LNC inner bound with advanced packing-mixing operations.
Derived a new outer bound exploiting algebraic structure.
Achieved a sum-rate gap smaller than 0.08% in most cases.
Abstract
This work considers the smart repeater network where a single source wants to send two independent packet streams to destinations with the help of relay . The transmission from or is modeled by packet erasure channels: For each time slot, a packet transmitted by may be received, with some probabilities, by a random subset of ; and those transmitted by will be received by a random subset of . Interference is avoided by allowing at most one of to transmit in each time slot. One example of this model is any cellular network that supports two cell-edge users when a relay in the middle uses the same downlink resources for throughput/safety enhancement. In this setting, we study the capacity region of when allowing linear network coding (LNC). The proposed LNC inner bound introduces more advanced…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Full-Duplex Wireless Communications · Advanced MIMO Systems Optimization
