Chi-Squared Geometry for Robust Finite-Blocklength Information and Dispersion Analysis

2026-08-17

AI Summary

本文提出了一种基于列的卡方几何方法，用于离散无记忆信道的信息和色散分析，通过不计算信道矩阵对数的方式获得紧致边界，解决了传统方法中需要复杂计算的问题。

Abstract

We develop a column-wise chi-squared geometry for discrete memoryless channels (DMCs) yielding tight, logarithm-free bounds on mutual information, channel dispersion, and finite-blocklength coding rates without evaluating logarithms of the channel matrix. The key parameter is~\(η\)---the worst-case relative deviation of a transition probability from its output marginal, which is small precisely when the channel is close to the fully noisy channel $t_{ij}=s_j$. We prove three main results: (1) a third-order ratio expansion showing \(I(X;Y)/χ^2(X;Y)\to 1/2\) as \(η\to 0\) with an \(O(η)\) skewness correction; (2) a two-sided dispersion equivalence bounding \(V(X;Y)\) above and below by \(χ^2(X;Y)\) with explicit constants \(c_{\pm}(η)\to 1\); and (3) a certified robust design rate \(R_{\mathrm{cert}}(n,\varepsilon)\) with total certification gap \(O(η)+O(η/\sqrt{n})+O(\log n/n)\). The certified bounds on \(I\) and \(V\) require only addition, multiplication, division, and square roots; the final rate also uses \(Q^{-1}(\varepsilon)\).

Problem

• chi-squared geometry
• discrete memoryless channels
• mutual information
• channel dispersion
• finite-blocklength coding rates

Innovation

• chi-squared geometry
• discrete memoryless channels
• finite-blocklength coding rates
• channel dispersion
• robust design rate