A theorem on the entropy of certain binary sequences and applications-II

By A. Wyner. 1973

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints (2018, background): “Proof of Proposition 7 For the first result, the lower bound follows from Zhang et al. (2013) (or Theorem 4), with a matching upper bound in Zhang et al. (2013). The lower bound of the second result follows from Theorem 2 (or along the same line of Han et al.”
Polar Codes for Channel and Source Coding (2009, methodology): “Wyner [66] showed that the achievable rate-distortion tuples (R, R′, D) satisfy {(R, R′, D) : R > h2(D ∗ p), R′ > 1 − h2(D), D ∈ [0, 1/2]}.”
Index Coding With Side Information (2006, unknown): “I. INTRODUCTION”