OurBigBook About$ Donate
 Sign in Sign up

Conditioned entropic Ruzsa distance of a summand

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Information theory Entropic Ruzsa distance Conditional entropic Ruzsa distance
Created 2026-09-24 Updated 2026-09-24  0 By others on same topic  0 Discussions Create my own version
If U,V,X are independent random variables in F2n​, then
dR​(U∣U+V;X)≤21​(dR​(U;X)+dR​(V;X)+dR​(U;V)).
(1)
Indeed, conditioning reduces entropy and independence give
dR​(U∣U+V;X)≤H(U+X)−21​H(U)−21​H(V)+21​H(U+V)−21​H(X).
(2)
In F2n​, V=U+(U+V), so conditional entropy under a deterministic change of variables shows that the left-hand side is unchanged when U and V are exchanged. Averaging the displayed bound with its exchanged version gives the result.

 Ancestors (7)

  1. Conditional entropic Ruzsa distance
  2. Entropic Ruzsa distance
  3. Information theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2025 / iii / Paper 164 / 4 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook