1 citations · 1 across the 5 of their papers we have counts for
7 papers
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…
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels
Hamed Hassani, Shrinivas Kudekar, Or Ordentlich +2
Consider a binary linear code of length , minimum distance , transmission over the binary erasure channel with parameter or the binary symmetric chann…
Minimum MS. E. Gerber's Lemma
Or Ordentlich, Ofer Shayevitz
Mrs. Gerber's Lemma lower bounds the entropy at the output of a binary symmetric channel in terms of the entropy of the input process. In this paper, we lower bound the output entr…
An Improved Upper Bound for the Most Informative Boolean Function Conjecture
Or Ordentlich, Ofer Shayevitz, Omri Weinstein
Suppose is a uniformly distributed -dimensional binary vector and is obtained by passing through a binary symmetric channel with crossover probability . A recent…