Exponent Span Capacity (ESC)

• ESC is defined as the scaling exponent (μ) that quantifies the trade-off between block length and the gap to capacity at a fixed error probability, particularly in polar codes.
• It dictates how quickly a code’s rate approaches channel capacity, with the required block length scaling as Θ(Δ^(-μ)) for binary-input memoryless symmetric channels.
• Recent advances have refined ESC bounds (e.g., μ ≤ 4.63) using multi-variate convex analysis, impacting design considerations for short-packet communications and decoding latency.

The Exponent Span Capacity (ESC), also referred to as the scaling exponent μ, quantifies the trade-off between block length and gap to channel capacity at a fixed block error probability for coding schemes, most notably for polar codes. In the scaling-exponent regime, the ESC describes how quickly a code's achievable rate approaches the capacity as block length increases, dictating fundamental limits of code performance over binary-input memoryless symmetric channels (BMSCs). The ESC governs the rate at which the required code block length must grow as the communication rate approaches the channel capacity for a non-vanishing error probability, providing critical insight into the finite-length performance of channel codes.

1. Formal Definition and Mathematical Characterization

Let $W$ denote a binary-input memoryless symmetric (BMS) channel with capacity $I(W)$. For a given block length $N$ and code rate $R_N$, the gap to capacity is defined as

$\Delta(N) = I(W) - R_N.$

The Exponent Span Capacity, or scaling exponent μ, is defined such that for any fixed error probability threshold ε, there exists a constant $C$ for which

$\Delta(N) \leq C N^{-1/\mu}$

holds for sufficiently large $N$ (Wang et al., 2022). Operationally, μ can be characterized as

$$\mu = \inf\Big\{ \alpha > 0 \mid \exists\, C < \infty \text{ such that } \Delta(N) \leq C N^{-1/\alpha} \text{ for all large } N \Big\}.$$

Alternatively, when considering a code with block error probability $P_e(N, R, W)$ at block length $I(W)$0 and rate $I(W)$1, for a fixed $I(W)$2, the required block length satisfies $I(W)$3 (Mondelli et al., 2013). The ESC thus captures how rapidly a code can approach channel capacity as a function of block length under fixed reliability requirements.

Mathematically, for polar codes, analyses leverage the Bhattacharyya parameter $I(W)$4, and the transformation properties under polarization. Defining a concave test function $I(W)$5 and synthesizing channels under Arıkan’s transform leads to the eigenvalue

$I(W)$6

and the exponent bound

$I(W)$7

Bounding $I(W)$8 guarantees a finite μ (Wang et al., 2022).

2. Historical Bounds and Context

The scaling exponent μ has become central to the theoretical characterization of polar codes and related coding schemes. Early analyses focused on the Binary Erasure Channel (BEC), leading to the first estimates. Notably,

• For the BEC, $I(W)$9 [BEC case—Arıkan–Telatar (2010), Hassani–Urbanke (2010)].
• For general BMS channels, rigorous bounds have evolved:
  • Lower: $N$0 [Guruswami–Goldberg–Ulukus, 2012]
  • Upper: $N$1 [Hassani–Alishahi–Urbanke, 2014]
  • $N$2 [Goldin–Burshtein, 2014]
  • $N$3 [Mondelli–Hassani–Urbanke, 2015]
  • $N$4 [Wang et al., 2022; (Wang et al., 2022)]

Progress in bounding μ has been driven by increasingly intricate analytical tools, culminating in the use of trivariate channel combining and convex envelope approximations (Wang et al., 2022). The sequence of bounds is summarized in the following table:

Reference and Year	μ Lower Bound	μ Upper Bound	Setting
Arıkan–Telatar (2010)	0.2669 ≤ 1/μ	0.2786 ≥ 1/μ	BEC only ($N$5)
Guruswami–Goldberg–Ulukus (2012)	3.553	—	General BMS
Hassani–Alishahi–Urbanke (2014)	3.579	6	General BMS
Goldin–Burshtein (2014)	—	5.702	General BMS
Mondelli–Hassani–Urbanke (2015)	—	4.714	General BMS
Wang et al. (2022)	—	4.63	General BMS

3. ESC in Coding Theory: Regimes and Operational Significance

The ESC contrasts with the error-exponent regime, where $N$6 exponentially as $N$7 for $N$8. In the scaling-law regime, the primary question is: for a fixed $N$9, what is the maximal rate $R_N$0 achievable for a given block length $R_N$1? The scaling law $R_N$2 emerges, where $R_N$3 is a universal mother curve (Mondelli et al., 2013). Holding $R_N$4 fixed, the required block length to approach gap $R_N$5 to capacity scales as $R_N$6. The ESC therefore governs the "speed" at which the code's rate approaches $R_N$7 at finite lengths under realistic constraints on error.

This characterization is critical for practical systems (e.g., 5G, short-packet communications) where long block-lengths are undesirable and thus rapid approach to capacity is prioritized.

4. ESC for Polar Codes: Analytical and Numerical Techniques

Improvements in the upper bound on μ for polar codes exploit new mathematical constructs:

• Introduction of a three-variate Bhattacharyya function $R_N$8 to analyze composite channel transformations,
• Construction of a lower tri-convex envelope $R_N$9 to facilitate convexity arguments,
• Development of a discrete convexification algorithm realized on a dense grid (200³ points),
• Deployment of finite-state, two-function “biased” power iteration involving state-dependent scoring functions $\Delta(N) = I(W) - R_N.$0.

By coordinating these steps, Wang et al. demonstrate an improved bound: $\Delta(N) = I(W) - R_N.$1 This result directly sharpens the prevailing upper bound for polar codes, indicating more rapid decay of the gap to capacity with $\Delta(N) = I(W) - R_N.$2 than previously proven (Wang et al., 2022).

5. Invariance of ESC Under Finite List and Genie-Aided Decoding

For list decoding and genie-aided scenarios, the invariance of μ is established for any fixed finite list size $\Delta(N) = I(W) - R_N.$3. In particular, for MAP decoding with list size $\Delta(N) = I(W) - R_N.$4 and for genie-aided SC decoding on the BEC (with $\Delta(N) = I(W) - R_N.$5 helps), the ESC does not decrease for any fixed $\Delta(N) = I(W) - R_N.$6 or $\Delta(N) = I(W) - R_N.$7:

• Enhanced list size in MAP decoding improves only the multiplicative constants in the scaling law, not the exponent μ (Mondelli et al., 2013).
• For polar codes, since the minimum distance $\Delta(N) = I(W) - R_N.$8, these results apply directly, and the same exponent μ remains for any finite $\Delta(N) = I(W) - R_N.$9.
• Genie-aided SC decoding (for up to $C$0 revealed bits) is shown to yield the same scaling exponent via the divide-and-intersect (DI) argument, using FKG-type inequalities for positive correlation.

A consequence is that techniques such as SCL (successive cancellation list) decoding cannot fundamentally reduce μ for any fixed list size. Whether μ can be decreased strictly for SCL with $C$1 is an open problem (Mondelli et al., 2013).

6. Implications and Applications in Finite-Length Regimes

The ESC directly controls how quickly $C$2 decays as block length increases. For example, for $C$3, the improved bound $C$4 implies $C$5, which improves upon previous bounds. Although these figures overestimate practical gaps, they determine the required polarization depth before most channels become reliable or unreliable (Wang et al., 2022).

In moderate-deviation regimes, where both error probability and gap to capacity are variable, a better μ expands the region of feasible operation. Hardware implementations also benefit, as a smaller μ reduces synthesis depth and, consequently, decoding latency and power consumption, particularly relevant at short block lengths.

7. Open Problems and Future Directions

While invariance of μ has been established for MAP and genie-aided decoding under finite resources, whether SCL decoding with finite (or even infinite) list size can yield a strictly smaller scaling exponent remains unresolved. Extending the divide-and-intersect method or identifying optimal finite-length bounds represents an active research direction. More precise estimates of μ for specific classes of BMS channels and for novel code constructions beyond polar codes also constitute important avenues for future work (Mondelli et al., 2013).