Achievability Bounds of Coding with Finite Blocklength for Gaussian Broadcast Channels
Abstract
In this paper, we study the achievable performance of dirty paper coding for the Gaussian broadcast channel (BC) with finite blocklength and we propose two different achievability bounds for this problem. We present the broadcast adaptation of dependence testing bound of Polyanskiy et al. 2010, which is an upper bound on the average error probability that depends on the channel dispersion terms of each error event for fixed input. Additionally, we introduce the $κβ$ lower bounds on the maximal code sizes of each user using dirty paper coding.
Fields of Study & Subjects
Error Correcting Code Techniques
Cooperative Communication and Network Coding
Advanced Wireless Communication Techniques
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 12 February 2026
- Language
- EN
- Document type
- Preprint