We construct a universal decoder for cyclic Gaussian multiple-input multiple-output channels with intersymbol interference and unknown channel taps and spatial noise covariance. Codewords are drawn independently and uniformly from a sphere of fixed total energy. Under stated bounds on frequency variation, the decoder a...
A theory of universal decoding built on the pairwise error probability (PEP) primitive, which extends to decoding with an erasure option and, via a discretization of separable metric families, to continuous alphabets.
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.
A one-shot (finite-blocklength) channel-coding framework based on the pairwise error probability (PEP) of a decoder with randomized tie-breaking that recovers several classical one-shot bounds, including the random-coding union bound and minimax meta-converse of Polyanskiy-Poor-Verdu, the information-spectrum bounds of...
Nir Elkayam, M. Feder· 2 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.