AI 中文总结
该研究推导了两用户高斯多址接入信道容量区域角点处的二阶编码率区域，通过构造矩形子码、利用相关定理与不等式完成证明，得到了与可达性界匹配的逆命题。
AI 中文摘要
针对两用户高斯多址接入信道容量区域的两个角点，我们建立了精确的二阶编码率区域。对于任意平均错误概率ε∈(0,1)，我们刻画了可实现速率在每个角点周围的n^{-1/2}尺度波动，证明了与已知可达性界匹配的逆命题。证明首先提取保留两个传输码字独立性的矩形子码；随后，Polyanskiy-Verdú优质码输出分布定理给出对数行列式约束，将修剪码本分解为弥散子空间和异常子空间的谱分解；熵Brascamp-Lieb投影不等式控制弥散子空间上的码字内积，方差膨胀高斯输出分布处理低维异常子空间。将两种处理方式结合，得到匹配二阶逆命题所需的联合高斯极限。
英文摘要
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.
Comments28 pages, 4 figures
