3 citations · 6 across the 5 of their papers we have counts for
5 papers
A simple bound on the BER of the MAP decoder for massive MIMO systems
Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy
The deployment of massive MIMO systems has revived much of the interest in the study of the large-system performance of multiuser detection systems. In this paper, we prove a non-t…
Rate-distance tradeoff for codes above graph capacity
Daniel Cullina, Marco Dalai, Yury Polyanskiy
The capacity of a graph is defined as the rate of exponential growth of independent sets in the strong powers of the graph. In the strong power an edge connects two sequences if at…
Bounds on the Reliability of a Typewriter Channel
Marco Dalai, Yury Polyanskiy
We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability . The lower bound is more of theoretical than practical importan…
Optimum Power Control at Finite Blocklength
Wei Yang, Giuseppe Caire, Giuseppe Durisi +1
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability , when the codewords are subject to a long-term (i.e., averag…
Diversity versus Channel Knowledge at Finite Block-Length
Wei Yang, Giuseppe Durisi, Tobias Koch +1
We study the maximal achievable rate R*(n, ε) for a given block-length n and block error probability εover Rayleigh block-fading channels in the noncoherent setting and in the fini…