Problem
Research questions and friction points this paper is trying to address.
Gaussian Multiple-Access Channel
Second-Order Asymptotics
Capacity Region
Second-Order Asymptotics for the Gaussian Multiple-Access Channel at Corner Points
🤖 AI Summary
研究解决了高斯多址接入信道在两个角点处的二阶渐进码率区域问题，通过提取子码、应用定理及分解码本等方法实现。
📝 Abstract
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 converse that matches the previously known achievability bound. The proof first extracts a rectangular subcode that preserves the independence of the two transmitted codewords. The Polyanskiy--Verdú good-code output distribution theorem then yields log-determinant constraints that induce a spectral decomposition of a trimmed codebook into diffuse and exceptional subspaces. An entropic Brascamp--Lieb projection inequality controls the codeword inner product on the diffuse subspace, while variance-inflated Gaussian output distributions handle the low-dimensional exceptional subspace. Combining these two treatments yields the joint Gaussian limit required for the matching second-order converse.
Innovation
Methods, ideas, or system contributions that make the work stand out.
second-order coding rate
Gaussian multiple-access channel
Polyanskiy-Verdú theorem
Brascamp-Lieb projection inequality
🔎 Similar Papers
No similar papers found.
