Skip to content

One-Shot Information Theory via the Pairwise Error Probability: Lossy, Joint Source-Channel, Erasure, and Multiuser Coding

Aug 2026 · arXiv.org · Vol abs/2608.15169 · 2 citations · 36 references
Computer Science Mathematics

TL;DR

This paper recovers the one-shot lossy bound of Matsuta-Uyematsu and the joint source-channel bounds in the Csiszar tradition, complements the lossy bounds of Kostina-Verdu, and connects the multiuser case to the comparable achievability/converse pair through three pairwise error events.

Abstract

This paper extends a one-shot (finite-blocklength) information-theoretic framework built on a single primitive: the pairwise error probability (PEP) of a randomized, dither-broken decoding rule, and the error spectrum it induces. A companion paper developed the framework for point-to-point channel coding -- uniformity of the PEP, the error-spectrum representation of achievability and converse, and the linear-programming form of the prior-optimized minimax meta-converse. Here we show that the same primitive, read on an enlarged candidate space, governs four further settings: lossy source coding under average distortion, joint source-channel coding with list decoding, channel coding with an erasure/undetected-error option, and the two-user multiple-access channel. In each case a single spectrum yields a random-coding achievability bound and exact fixed-code identities, and we indicate how the convex -- indeed linear-programming -- prior optimization of the channel-coding case extends under matched decoding. The development recovers the one-shot lossy bound of Matsuta-Uyematsu and the joint source-channel bounds in the Csiszar tradition, complements the lossy bounds of Kostina-Verdu, and connects the multiuser case to the comparable achievability/converse pair through three pairwise error events.

View source

Similar papers

Sep 2026

Joint Source-Channel Coding of Gaussian Sources over Block Erasure Channels: Nonasymptotic Bounds and Channel-Uniform Normal Approximations

We study finite-blocklength lossy transmission of a Gaussian memoryless source over memoryless, possibly nonstationary block erasure channels under an excess mean-squared distortion criterion. We derive computable nonasymptotic achievability and converse bounds and establish matching third-order, channel-uniform normal...

A. Mahmood · 0 citations
Sep 2026

Adaptive Coding for Two-Way Wiretap Channels with One-Sided Strong Secrecy

A multiround leakage theorem is proved that accounts both for information revealed about a key before its later use and for the possibility that an encoder uses an incorrectly decoded key.

Masahito Hayashi, Yan-Ling Chen · 0 citations
Sep 2026

A Tight Second-Order Converse Bound for Variable-Length Feedback Codes

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.

Recep Can Yavas · 0 citations
Preprint Nov 2026

Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels

To characterize the performance benefit of joint decoding, numerical and closed-form achievability bounds for the two-user Gaussian MAC under joint nearest-neighbor (JNN) decoding are derived and performance differences among the proposed SIC and JNN bounds are illustrated.

Kai-Xuan Bao, Wei Xu, Xiao-Hu You · 0 citations
Open access Oct 2026

Frozen-Bit Jammer Steering (FB-JS): Mitigating Multi-Band Channel Erasures in 5G Polar Codes

Simulation results confirm that FB-JS successfully isolates targeted jamming erasures and maintains baseline-equivalent error performance under heavy multi-band interference, providing a resilient, low-complexity physical-layer defense for tactical 5G/6G communication networks.

Haider A. Abdulkarim · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.