Skip to content

Author

M. Feder

We have 4 of 322 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Universal Decoding for Gaussian MIMO-ISI: Spherical Ensembles and Symmetric Neighborhoods

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...

Nir Elkayam, M. Feder · 0 citations
Preprint Aug 2026

Universal Decoding via the Pairwise Error Probability

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.

Nir Elkayam, M. Feder · 0 citations
Aug 2026

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

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.

Nir Elkayam, M. Feder · 2 citations
Preprint Aug 2026

A Pairwise-Error-Probability Framework for One-Shot Information Theory

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.