64 citations · 243 across the 40 of their papers we have counts for
5 papers · 1 filter
A Note on the Probability of Rectangles for Correlated Binary Strings
Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
Consider two sequences of independent and identically distributed fair coin tosses, and , which are -correlated for each , i.e. $…
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich +1
The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably…
Above the Nyquist Rate, Modulo Folding Does Not Hurt
Elad Romanov, Or Ordentlich
We consider the problem of recovering a continuous-time bandlimited signal from the discrete-time signal obtained from sampling it every seconds and reducing the result modul…
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
Yuval Kochman, Or Ordentlich, Yury Polyanskiy
We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open probl…
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs
Elad Romanov, Or Ordentlich
We consider the problem of recovering i.i.d samples from a zero mean multivariate Gaussian distribution with an unknown covariance matrix, from their modulo wrapped measurement…