betaFeedback

WorksComputer Science

Second-Order Asymptotics for the Scalar Gaussian Broadcast Channel

Abstract

This paper characterizes the second-order coding region of the scalar Gaussian broadcast channel along the curved boundary of its capacity region. The characterization holds under both average and maximal error criteria and allows correlation between the receiver noises. At each interior point of this boundary, the second-order region is a halfspace, as in the work of Scarlett and the author on Gaussian multiple-access channels with degraded message sets. Achievability follows from spherical superposition coding with a blocklength-dependent power allocation. The main innovation lies in the converse. Using Ornstein–Uhlenbeck entropy dissipation and Gaussian functional inequalities, we construct an auxiliary observation through an additive Gaussian noise channel and establish quantitative relative entropy bounds for the channel output distributions conditioned on this observation. The strong functional representation lemma of Li and El Gamal then allows us to select a realization of its independent random seed to obtain a deterministic partition of the retained receiver-1 message set. The component label plays a role analogous to the auxiliary random variable in the capacity characterization, while providing the distributional control needed at the second-order scale. These properties guide the construction of auxiliary output measures whose likelihood ratios admit the cancellations and normal approximation needed to evaluate an information spectrum converse.

Introduction

The broadcast channel, introduced by Cover in 1972 [1], is a paradigmatic model in network information theory for noisy one-to-many communication. It provides a natural model for studying downlink communication in wireless systems, among other applications. In this model, a single sender wishes to communicate a private message to each receiver. We consider only two receivers in this paper, and no common message is sent to both. The capacity region, defined as the closure of the set of achievable rate pairs, is unknown in general. For degraded broadcast channels, in which one receiver is “stronger” than the other, the capacity region is known. It is achieved via superposition coding [1], [2], in which the weaker receiver decodes its intended message, while the stronger receiver decodes both messages using successive cancellation. This scheme, however, is not optimal in general. Marton’s inner bound [3] is the best-known achievability result, but it was recently shown to be suboptimal for some broadcast channels [4].

For the scalar Gaussian broadcast channel, which is stochastically degraded [5 Sec. 5.4], the story is more complete, at least in the first-order sense. Cover [1] and Bergmans [6] showed that the capacity region consists of all nonnegative rate pairs (R1,R2)(R_1,R_2) such that

R1≤C(αS1),R2≤C(αˉS21+αS2)(1)R_1 \le C(\alpha S_1), \qquad R_2 \le C\left(\frac{\bar{\alpha} S_2}{1+\alpha S_2}\right) \tag*{(1)}

for some α∈[0,1]\alpha\in[0,1]. Here, C(x):=12log⁡(1+x)C(x) := \frac{1}{2}\log(1+x) is the Gaussian capacity function, S1>S2>0S_1>S_2>0 are the signal-to-noise ratios at the two receivers, and α\alpha and αˉ:=1−α\bar{\alpha} := 1-\alpha represent the fractions of transmit power allocated to their respective messages. The weak converse was proved by Bergmans using the entropy power inequality (EPI). See Figure 1 for an illustration of the capacity region.

The three boundary regimes of the Gaussian broadcast channel capacity region

Figure 1. The three boundary regimes of the Gaussian broadcast channel capacity region.

Our goal in this paper is to go beyond this first-order characterization and study the second-order asymptotics of the Gaussian broadcast channel. Second-order asymptotics [7] characterize how achievable rates approach the capacity boundary at the n−1/2n^{-1/2} scale for a fixed nonvanishing error probability. Nailing down the constants governing this approach at a fixed boundary point is the focus of our study. For the point-to-point Gaussian channel, the corresponding normal approximation and third-order refinement are well understood through the works of Hayashi [8], Polyanskiy, Poor, and Verdú [9], and Tan and Tomamichel [10], among others.

To study the second-order behavior of the Gaussian broadcast channel around its capacity boundary, it is imperative to understand whether the strong converse holds. That is, if we allow a fixed nonvanishing error probability strictly below one, is the capacity region still the one in (1)? Under the per-codeword power constraint, Fong and Tan [11] established the strong converse. Their converse also gives an O(n−1/2)O(n^{-1/2}) outer approximation to the capacity region. This identifies the relevant scale but not the sharp second-order coefficients: for error probabilities below 1/21/2, it permits an outward displacement where an inward backoff is expected.

The main contribution of this paper is an exact characterization of the second-order coding region along the curved capacity boundary, stated in Theorem 1. The characterization applies under both the average and maximal error criteria, with an error occurring whenever either receiver fails to decode its intended message, and allows correlation between the receiver noises. At each interior point of this boundary, we show that the optimal second-order region is a halfspace. From the perspective of achievability, this form should not come as a surprise. The first-order region is achieved via superposition coding. Early second-order achievability bounds for discrete memoryless asymmetric broadcast channels were obtained by Tan and Kosut [12]. For the Gaussian multiple-access channel with degraded message sets, Scarlett and Tan [13] subsequently characterized the second-order region using spherical superposition coding and normal approximations. A similar strategy is therefore natural here. Indeed, our achievability proof largely follows these Gaussian techniques; see also the Gaussian broadcast channel achievability results of Tuninetti et al. [14]. Allowing the power allocation to vary at the n−1/2n^{-1/2} scale yields the claimed halfspaces.

The main innovation in this work lies in the converse. As noted in the author’s monograph [7], establishing tight second-order converses has historically been challenging for network information theory problems whose standard first-order characterizations involve auxiliary random variables; recent works on various source coding problems provide notable examples of progress; see, e.g., [15]. The difficulty is that the information spectrum methods used for second-order analysis do not readily combine with the usual methods for identifying auxiliaries in weak and strong converses. In particular, identifying an auxiliary random variable that suffices for a first-order bound need not provide the distributional control required to retain the relevant second-order fluctuations. We explain this difficulty, and how the present proof addresses it, in the next two subsections.

Existing Converse Techniques and the Role of Auxiliaries

At this point, it seems opportune to review existing converse techniques for broadcast channels, focusing on how auxiliaries are identified and what more is needed for a matching second-order converse.

a) Weak converses and the identification of auxiliaries: Gallager’s weak converse [16] starts from Fano’s inequality. For codes with vanishing error probability and rates converging to (R1,R2)(R_1,R_2),

nR1≤I(W1;Y1n)+o(n),nR2≤I(W2;Y2n)+o(n).(2)nR_1 \le I(W_1;Y_1^n) + o(n), \qquad nR_2 \le I(W_2;Y_2^n) + o(n). \tag*{(2)}

Here, WjW_j is receiver jj’s intended message and YjnY_j^n its channel output. For this first-order argument, a stochastically degraded channel can be replaced by a physically degraded one with the same marginals. Gallager’s “nonintuitive” identification of the auxiliary random variable, as described by El Gamal and Kim [5], is Ui:=(W2,Y1i−1)U_i := (W_2,Y_1^{i-1}). The chain rule, degradedness, and time sharing then yield

R1≤I(X;Y1∣U),R2≤I(U;Y2)(3)R_1 \le I(X;Y_1|U), \qquad R_2 \le I(U;Y_2) \tag*{(3)}

for some PU,XP_{U,X}. Together with superposition coding, this characterizes the capacity region. Conditioning on the auxiliary random variable UU specifies the input distribution used in the characterization. In the Gaussian case, applying the EPI to these bounds introduces the power split α\alpha and yields (1).

Nair [17] provides a complementary viewpoint by expressing the degraded broadcast channel capacity region through upper concave envelopes of mutual information functionals. This representation incorporates the optimization over mixtures of input distributions without displaying an auxiliary random variable explicitly. The resulting first-order characterization, however, does not by itself provide the quantitative control of joint information-density fluctuations required for a tight second-order converse.

b) Blowing-up and Gaussian concentration: Ahlswede, Gács, and Körner [18] enlarge decoding sets using the blowing-up lemma to obtain lists of subexponential size containing the correct messages with probability tending to one. For maximal error bounded away from one, a list version of Fano’s inequality gives mutual information bounds with o(n)o(n) remainders, after which the usual single-letterization steps apply. A related formulation uses the image-size characterizations developed by Csiszár and Körner [19 Ch. 15]. For a fixed η∈(0,1)\eta\in(0,1), an η\eta-image of a set of input sequences is an output set having conditional probability at least η\eta for every input sequence in that set. These characterizations translate decoding requirements into entropy and mutual information constraints; their applications to network problems, including the asymmetric broadcast channel, are developed in [19 Ch. 16].

For Gaussian channels, Fong and Tan [11] instead use the Gaussian Poincaré inequality [20 Theorem 3.20] to bound the conditional variances of certain information densities, given the transmitted message pair. After an average-to-maximal-error reduction, Chebyshev’s inequality and averaging turn an information spectrum bound into mutual information bounds with O(n)O(\sqrt{n}) remainders. Combining these with the EPI establishes the strong converse.

c) Reverse hypercontractivity: Liu, van Handel, and Verdú [21] smooth decoding functions using reverse hypercontractivity of Markov semigroups. This yields strengthened Fano-type inequalities and, in particular, converse bounds under the maximal error criterion with O(n)O(\sqrt{n}) remainders for degraded discrete memoryless and Gaussian broadcast channels. In the Gaussian setting, the smoothing uses the Ornstein–Uhlenbeck semigroup [22 Sec. 2.7.1], and the resulting mutual information bounds are evaluated using the EPI. The resulting correction remains positive and therefore has the same directional limitation as Fong and Tan’s bound when the error probability is below 1/21/2.

d) Exponent methods and edge removal: For discrete memoryless degraded broadcast channels, Oohama [23] combines information spectrum bounds, exponential moment estimates, and a recursive choice of auxiliary distributions. The resulting single-letter lower bound on the correct-decoding exponent is strictly positive outside the capacity region. A related method applies to broadcast channels with degraded message sets [24].

Kosut and Kliewer [25] relate strong converses to edge-removal properties, obtaining an exponential strong converse for general discrete memoryless broadcast channels. Their result does not require a known single-letter capacity characterization: proving a strong converse need not itself identify auxiliaries with which to evaluate the capacity region.

e) Change of measure and Markov constraints: Tyagi and Watanabe [26] condition the original distribution on successful decoding. Since conditioning can alter both Markov relations and channel transition probabilities, they replace exact Markov constraints by information penalties in a variational characterization. Their applications include source coding and the wiretap channel. The same conditioning step applies to broadcast channels, although completing the converse requires a suitable penalized single-letter bound. This approach highlights another difficulty of handling auxiliaries: the relations involving the auxiliaries must be controlled under the changed distribution before the weak converse argument can be recovered.

The Challenge of a Tight Second-Order Converse and Our Approach

For a tight second-order converse, identifying an auxiliary random variable that yields the correct mutual information bounds is not enough. These bounds concern expectations, whereas the second-order region depends on joint fluctuations of the information densities. Since the second-order term in the log message sizes is itself of order n\sqrt{n}, an unspecified O(n)O(\sqrt{n}) remainder does not determine its coefficient. A Verdú–Han-type information spectrum bound [27] is therefore a natural starting point, but its evaluation requires additional distributional control.

Here is where our main contribution lies. We first construct an auxiliary additive Gaussian noise channel (see Figure 8) and establish quantitative relative entropy bounds for the broadcast channel output distributions conditioned on the resulting auxiliary observation. We then apply the strong functional representation lemma (SFRL) of Li and El Gamal [28] and select a suitable realization of its independent seed to obtain a deterministic partition of the retained receiver-1 message set. The component label plays a role analogous to the auxiliary UU in (3), while additionally providing the distributional control needed at the second-order scale.

Illustration of the auxiliary channel and its consequences

Figure 8. Illustration of the auxiliary channel in (145) and its consequences.

The SFRL has found applications in universal compression representations [29], privacy-utility tradeoffs [30], and rate-distortion-perception theory [31]. Here, it controls the conditional entropy of the component label given the receiver-2 output while retaining bounds on the average Gaussian relative entropy of the component outputs. Combined with Ornstein–Uhlenbeck entropy dissipation and Gaussian functional inequalities [22], these properties allow us to construct auxiliary output measures for which the codeword-dependent terms cancel in a weighted sum of the conditional means of the information densities. The remainder terms have zero conditional mean given the transmitted codeword and are controlled by variance bounds, while the principal joint fluctuations are evaluated by a normal approximation. More details are provided in Section IV.

Notational Conventions

Throughout the paper, logarithms are natural, so information quantities are measured in nats. We write ex=exp⁡(x)e^{x} = \exp(x). We use the usual information-theoretic notation [5] for entropy H(X)H(X), conditional entropy H(X∣Y)H(X|Y), differential entropy h(X)h(X), mutual information I(X;Y)I(X;Y), and relative entropy D(P∥Q)D(P\|Q).

We write Xn=(X1,…,Xn)X^{n} = (X_{1},\ldots,X_{n}) for a length-nn random vector and xn=(x1,…,xn)x^{n} = (x_{1},\ldots,x_{n}) for its realizations. For xn,yn∈Rnx^{n},y^{n} \in\mathbb{R}^{n}, let ⟨xn,yn⟩=∑i=1nxiyi\langle x^{n},y^{n}\rangle= \sum_{i=1}^{n}x_{i}y_{i} denote their inner product and ∥xn∥=⟨xn,xn⟩\|x^{n}\| = \sqrt{\langle x^{n},x^{n}\rangle} the Euclidean norm. For a real matrix AA, its squared Hilbert–Schmidt norm is ∥A∥HS2=tr⁡(ATA)\|A\|_{\mathrm{HS}}^{2} = \operatorname{tr}(A^{\mathsf{T}}A). The matrix InI_{n} denotes the n×nn \times n identity matrix. We use ∇h\nabla h and ∇2h\nabla^{2}h for the gradient and Hessian of a scalar-valued function hh, respectively, and Jac⁡F\operatorname{Jac}F for the Jacobian matrix of a vector-valued function FF. For a random vector XnX^{n} with finite second moment, define the minimum mean-squared error given YY as mmse⁡(Xn∣Y):=E[∥Xn−E[Xn∣Y]∥2]\operatorname{mmse}(X^{n}|Y) := \mathbb{E}[\|X^{n}-\mathbb{E}[X^{n}|Y]\|^{2}].

The Gaussian distribution with mean vector μ\mu and covariance matrix Σ\Sigma is denoted by N(μ,Σ)\mathcal{N}(\mu,\Sigma). The standard Gaussian density and cumulative distribution function are ϕ(x):=12πe−x2/2\phi(x) := \frac{1}{\sqrt{2\pi}}e^{-x^{2}/2} and Φ(x):=∫−∞xϕ(u) du\Phi(x) := \int_{-\infty}^{x}\phi(u)\,\mathrm{d}u. In nn dimensions, we write ϕn:=N(0,In)\phi_{n} := \mathcal{N}(0,I_{n}) for the standard Gaussian distribution and ϕn(xn)\phi_{n}(x^{n}) for its density at xnx^{n}.

All asymptotics are as n→∞n \to\infty. For subsequent clarity, we adopt a slightly unconventional but intuitive sign convention for the O(⋅)O(\cdot) notation: for a positive sequence ana_{n}, we use O(an)O(a_{n}) to denote a nonnegative sequence bounded above by a constant multiple of ana_{n} for all sufficiently large nn. Accordingly, −O(an)-O(a_{n}) denotes the negative of such a sequence. The implicit constants may depend on channel parameters, a boundary point of the capacity region, and specified ranges of error probabilities, but not on nn or the codebook. Any additional uniformity is stated explicitly. Quantities such as relative entropies may depend on nn, even when this dependence is not shown explicitly.

Problem Setting and Main Result

Channel Model and Code Definition

We consider the Gaussian broadcast channel Y~nj=X~n+Z~jn\widetilde{Y}_{n}^{j} = \widetilde{X}^{n} + \widetilde{Z}_{j}^{n}, j=1,2j = 1,2, used without feedback under the per-codeword power constraint ∥x~n(m1,m2)∥2≤nP\|\widetilde{x}^{n}(m_{1},m_{2})\|^{2} \le nP, where P>0P > 0. The noise pairs {(Z~1,i,Z~2,i)}i=1n\{(\widetilde{Z}_{1,i},\widetilde{Z}_{2,i})\}_{i=1}^{n} are zero-mean jointly Gaussian random vectors that are independent and identically distributed over channel uses and independent of the messages. They each have covariance matrix

Cov⁡(Z~1,iZ~2,i)=(N1ρN1N2ρN1N2N2)where 0<N1<N2and∣ρ∣≤1.(4)\operatorname{Cov}\begin{pmatrix}\widetilde{Z}_{1,i}\\ \widetilde{Z}_{2,i}\end{pmatrix} = \begin{pmatrix} N_{1} & \rho\sqrt{N_{1}N_{2}}\\ \rho\sqrt{N_{1}N_{2}} & N_{2} \end{pmatrix} \quad\text{where } 0 < N_{1} < N_{2} \quad\text{and} \quad|\rho| \le1. \tag*{(4)}

Here NjN_j is the noise variance from the transmitter to receiver jj and ρ\rho is the noise correlation coefficient. To reduce notation, we introduce the signal-to-noise ratios

Sj:=PNj,j=1,2,S1>S2>0.(5)S_j := \frac{P}{N_j}, \qquad j=1,2, \qquad S_1>S_2>0. \tag*{(5)}

References

  1. [1]T. M. Cover, “Broadcast channels,” IEEE Trans. Inform. Theory, vol. 18, pp. 2–14, Jan. 1972.DOI
  2. [2]P. P. Bergmans, “Random coding theorem for broadcast channels with degraded components,” IEEE Trans. Inform. Theory, vol. 19, pp. 197–207, Mar. 1973.DOI
  3. [3]K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Trans. Inform. Theory, vol. 25, pp. 306–311, May 1979.DOI
  4. [4]M. Huang, Y. Liu, and Y. Liu, “Sub-optimality of Marton’s inner bound for the two-receiver broadcast channel,” arXiv:2608.19869, Aug. 2026.
  5. [5]A. El Gamal and Y.-H. Kim, Network Information Theory. Cambridge, U.K.: Cambridge University Press, 2012.
  6. [6]P. P. Bergmans, “A simple converse for broadcast channels with additive white Gaussian noise,” IEEE Trans. Inform. Theory, vol. 20, pp. 279–280, Mar. 1974.DOI
  7. [7]V. Y. F. Tan, “Asymptotic estimates in information theory with non-vanishing error probabilities,” Found. Trends Commun. Inf. Theory, vol. 11, no. 1–2, pp. 1–184, 2014.
  8. [8]M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,” IEEE Trans. Inform. Theory, vol. 55, pp. 4947–4966, Nov. 2009.DOI
  9. [9]Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding rate in the finite blocklength regime,” IEEE Trans. Inform. Theory, vol. 56, pp. 2307–2359, May 2010.DOI
  10. [10]V. Y. F. Tan and M. Tomamichel, “The third-order term in the normal approximation for the AWGN channel,” IEEE Trans. Inform. Theory, vol. 61, pp. 2430–2438, May 2015.
  11. [11]S. L. Fong and V. Y. F. Tan, “A proof of the strong converse theorem for Gaussian broadcast channels via the Gaussian Poincaré inequality,” IEEE Trans. Inform. Theory, vol. 63, pp. 7737–7746, Dec. 2017.arxiv.org/abs/1509.01380
  12. [12]V. Y. F. Tan and O. Kosut, “On the dispersions of three network information theory problems,” IEEE Trans. Inform. Theory, vol. 60, pp. 881–903, Feb. 2014.
  13. [13]J. Scarlett and V. Y. F. Tan, “Second-order asymptotics for the Gaussian MAC with degraded message sets,” IEEE Trans. Inform. Theory, vol. 61, pp. 6700–6718, Dec. 2015.
  14. [14]D. Tuninetti, P. Sheldon, B. Smida, and N. Devroye, “On second order rate regions for the static scalar Gaussian broadcast channel,” IEEE J. Sel. Areas Commun., vol. 41, pp. 1982–1999, July 2023.arxiv.org/abs/2209.15050
  15. [15]J. Liu, “Dispersion bound for the Wyner–Ahlswede–Körner network via a semigroup method on types,” IEEE Trans. Inform. Theory, vol. 67, pp. 869–885, Feb. 2021.DOI
  16. [16]R. G. Gallager, “Capacity and coding for degraded broadcast channels,” Probl. Inf. Transm., vol. 10, no. 3, pp. 185–193, 1974.
  17. [17]C. Nair, “Upper concave envelopes and auxiliary random variables,” Int. J. Adv. Eng. Sci. Appl. Math., vol. 5, pp. 12–20, Mar. 2013.DOI
  18. [18]R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Z. Wahrscheinlichkeitstheor. Verw. Geb., vol. 34, pp. 157–177, June 1976.DOI
  19. [19]I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. Cambridge, U.K.: Cambridge University Press, 2nd ed., 2011.
  20. [20]S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford: Oxford University Press, 2013.
  21. [21]J. Liu, R. van Handel, and S. Verdú, “Second-order converses via reverse hypercontractivity,” Math. Stat. Learn., vol. 2, no. 2, pp. 103–163, 2019.arxiv.org/abs/1812.10129
  22. [22]D. Bakry, I. Gentil, and M. Ledoux, Analysis and Geometry of Markov Diffusion Operators, vol. 348 of Grundlehren der mathematischen Wissenschaften. Cham: Springer, 2014.DOI
  23. [23]Y. Oohama, “Strong converse exponent for degraded broadcast channels at rates outside the capacity region,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), (Hong Kong, China), pp. 939–943, June 2015.DOI
  24. [24]Y. Oohama, “New strong converse for asymmetric broadcast channels.” arXiv:1604.02901, Apr. 2016. Version 4, revised August 2020.arxiv.org/abs/1604.02901
  25. [25]O. Kosut and J. Kliwer, “Strong converses are just edge removal properties,” IEEE Trans. Inform. Theory, vol. 65, pp. 3315–3339, June 2019.arxiv.org/abs/1706.08172
  26. [26]H. Tyagi and S. Watanabe, “Strong converse using change of measure arguments,” IEEE Trans. Inform. Theory, vol. 66, pp. 689–703, Feb. 2020.
  27. [27]S. Verdú and T. S. Han, “A general formula for channel capacity,” IEEE Trans. Inform. Theory, vol. 40, pp. 1147–1157, July 1994.DOI
  28. [28]C. T. Li and A. El Gamal, “Strong functional representation lemma and applications to coding theorems,” IEEE Trans. Inform. Theory, vol. 64, pp. 6967–6978, Nov. 2018.arxiv.org/abs/1701.02827
  29. [29]G. Zhang, J. Qian, J. Chen, and A. Khisti, “Universal rate-distortion-perception representations for lossy compression,” in Advances in Neural Information Processing Systems, vol. 34, pp. 11517–11529, Curran Associates, Inc., 2021.arxiv.org/abs/2106.10311
  30. [30]A. Zamani, T. J. Oechtering, and M. Skoglund, “On the privacy-utility trade-off with and without direct access to the private data,” IEEE Trans. Inform. Theory, vol. 70, pp. 2177–2200, Mar. 2024.arxiv.org/abs/2212.12475
  31. [31]L. Theis and A. B. Wagner, “A coding theorem for the rate-distortion-perception function,” in ICLR Neural Compression Workshop, 2021. arXiv:2104.13662.arxiv.org/abs/2104.13662
  32. [32]J. Scarlett, A. Martinez, and A. Guillén i Fàbregas, “Second-order rate region of constant-composition codes for the multiple-access channel,” IEEE Trans. Inform. Theory, vol. 61, pp. 157–172, Jan. 2015.
  33. [33]W. V. Li and Q.-M. Shao, “A normal comparison inequality and its applications,” Probab. Theory Related Fields, vol. 122, pp. 494–508, Apr. 2002.DOI
  34. [34]E. MolavianJazi and J. N. Laneman, “A second-order achievable rate region for Gaussian multi-access channels via a central limit theorem for functions,” IEEE Trans. Inform. Theory, vol. 61, pp. 6719–6733, Dec. 2015.DOI
  35. [35]R. C. Yavas, V. Kostina, and M. Effros, “Gaussian multiple and random access channels: Finite-blocklength analysis,” IEEE Trans. Inform. Theory, vol. 67, pp. 6983–7009, Nov. 2021.DOI
  36. [36]S. Boucheron and M. R. Salamatian, “About priority encoding transmission,” IEEE Trans. Inform. Theory, vol. 46, pp. 699–705, Mar. 2000.DOI
  37. [37]V. V. Petrov, Sums of Independent Random Variables, vol. 82 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Berlin, Heidelberg: Springer-Verlag, 1975.DOI
  38. [38]V. Bentkus, “A Lyapunov-type bound in R^d,” Theory Probab. Appl., vol. 49, pp. 311–323, Jan. 2005.
  39. [39]A. Dytsо, H. V. Poor, and S. Shamai (Shitz), “Conditional mean estimation in Gaussian noise: A meta derivative identity with applications,” IEEE Trans. Inform. Theory, vol. 69, pp. 1883–1898, Mar. 2023.
  40. [40]D. Guo, S. Shamai, and S. Verdú, “Mutual information and minimum mean-square error in Gaussian channels,” IEEE Trans. Inform. Theory, vol. 51, pp. 1261–1282, Apr. 2005.arxiv.org/abs/cs/0412108
  41. [41]M. Talagrand, “Transportation cost for Gaussian and other product measures,” Geom. Funct. Anal., vol. 6, pp. 587–600, May 1996.DOI
  42. [42]M. Hayashi and H. Nagaoka, “General formulas for capacity of classical-quantum channels,” IEEE Trans. Inform. Theory, vol. 49, pp. 1753–1768, July 2003.DOI
  43. [43]D. Cao, “Exact second-order asymptotics for the Wyner–Ahlswede–Körner problem.” arXiv:2608.21991, Aug. 2026.arxiv.org/abs/2608.21991
  44. [44]L. Zhou, “Exact second-order asymptotics for the discrete Wyner–Ziv problem.” arXiv:2610.11998, Oct. 2026.arxiv.org/abs/2610.11998

Paper details

vlnc:W_wc92psqd
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

OpenAI Codex, Claude Opus 5 (bare)

View statement
Looking for related papers…
Contents