This achievability proof builds on the constant composition and coded time-sharing framework of Scarlett, Martinez, and Guill\'en i F\`abregas, with an optimization over admissible power splits, and establishes the optimality of the resulting coded time-sharing strategy.
Abstract
We completely characterize the second-order coding rate region of the two-user Gaussian multiple-access channel at points in the relative interior of the sum-rate face, under maximal per-codeword power constraints. For any fixed average error probability $0<\varepsilon<1/2$, a nontrivial mixture of power splits reduces the sum-rate dispersion and strictly improves upon standard inner bounds based on a constant power split. Thus, a constant power split, although sufficient to attain the first-order capacity region, is insufficient for second-order optimality in this regime. Our achievability proof builds on the constant composition and coded time-sharing framework of Scarlett, Martinez, and Guill\'en i F\`abregas, with an optimization over admissible power splits. A matching second-order converse establishes the optimality of the resulting coded time-sharing strategy.
We establish exact second-order coding rate regions at the two corner points of the capacity region of the two-user Gaussian multiple-access channel. For any average error probability $\varepsilon\in(0,1)$, we characterize the $n^{-1/2}$-scale fluctuations of achievable rates around each corner point, proving a convers...
A converse is derived, establishing the second-order fundamental limit for every positive-capacity discrete memoryless channel with finite $C_1$, which covers the moderate-deviations and error-exponent regimes, including polynomially decaying error probabilities.
A polynomial-size linear programming bound for locally recoverable codes with locality parameters $(r,\delta)$, without assuming linearity is given, which has polynomially many variables and its optimum dominates the ordinary Delsarte bound.
We determine the exact second-order asymptotics of covert communication over binary-input discrete memoryless channels when covertness is measured by variational distance. Previous work by Tahmasbi and Bloch [IEEE Trans. Inf. Theory, Apr. 2019] characterized the first-order asymptotics and derived achievability and con...
Qiao-Sheng Zhang, Lin Zhou, Xue-Long Li· 0 citations
We determine the exact local second-order rate region of the finite-alphabet Wyner--Ahlswede--K\"orner problem under full support, at informative boundary points exposed by a finite supporting slope. The characterization permits nonunique optimizing test channels with unequal information variances and requires no neigh...
Among $n+1$ equiprobable equal-energy signals in $\R^n$ under additive white Gaussian noise with maximum-likelihood decoding, which arrangement maximizes the probability of correct decoding? The question is Shannon's, recorded by Rice in 1950. Mulgund proved in 2026 that the regular-simplex value bounds the correct-dec...
Meng-Wei Su, Kai-Wen Yang, Hao Xu et al.· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
