On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
From MaRDI portal
Recommendations
- On the Achievable Sum Rate for MIMO Interference Channels
- Rate Splitting and Successive Decoding for Gaussian Interference Channels
- Optimal Achievable Rates for Interference Networks With Random Codes
- Maximizing the Sum Rate in Symmetric Networks of Interfering Links
- Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels
- Achievable Rates for K-User Gaussian Interference Channels
- Decentralized Sum Rate Maximization With QoS Constraints for Interfering Broadcast Channel Via Successive Convex Approximation
- On the Achievable Rate Regions for Interference Channels With Degraded Message Sets
- Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding
Cited in
(8)- Optimal Achievable Rates for Interference Networks With Random Codes
- On the Achievable Sum Rate for MIMO Interference Channels
- On the Achievable Rate Regions for Interference Channels With Degraded Message Sets
- Sum-Rate Maximization for Two-Way Active Channels
- Decentralized Sum Rate Maximization With QoS Constraints for Interfering Broadcast Channel Via Successive Convex Approximation
- Discrete Sum Rate Maximization for MISO Interference Broadcast Channels: Convex Approximations and Efficient Algorithms
- Successive Refinement With Decoder Cooperation and Its Channel Coding Duals
- Hierarchical Successive Group Decoding Achieves Capacity in the Multiple Access Channel With General Message Sets
This page was built for publication: On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271911)