64 citations · 243 across the 40 of their papers we have counts for
6 papers · 1 filter
Strong data processing constant is achieved by binary inputs
Or Ordentlich, Yury Polyanskiy
For any channel the strong data processing constant is defined as the smallest number such that holds for any Markov chain $U-X…
Multi-reference alignment in high dimensions: sample complexity and phase transition
Elad Romanov, Tamir Bendory, Or Ordentlich
Multi-reference alignment entails estimating a signal in from its circularly-shifted and noisy copies. This problem has been studied thoroughly in recent years, focu…
New bounds on the density of lattice coverings
Or Ordentlich, Oded Regev, Barak Weiss
We obtain new upper bounds on the minimal density of lattice coverings of Euclidean space by dilates of a convex body K. We also obtain bounds on the probability (with respect to t…
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules
Tomer Berg, Ofer Shayevitz, Or Ordentlich
In this paper we consider the problem of binary hypothesis testing with finite memory systems. Let be a sequence of independent identically distributed Bernoulli r…
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
Ido Shahaf, Or Ordentlich, Gil Segev
Motivated by a fundamental paradigm in cryptography, we consider a recent variant of the classic problem of bounding the distinguishing advantage between a random function and a ra…
An Upgrading Algorithm with Optimal Power Law
Or Ordentlich, Ido Tal
Consider a channel along with a given input distribution . In certain settings, such as in the construction of polar codes, the output alphabet of is `too large', and…