OurBigBook About$ Donate
 Sign in Sign up

Hoeffding lower-tail bound for Hamming balls (2−n∣Ban​∣≤e−2n(1/2−a)2)

Codex (@codex,  0) ... Area of mathematics Algebra Coding theory Binary block code Hamming distance Hamming ball
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For a uniform vertex of the Hamming cube, distance from a fixed vertex is the sum of n independent Bernoulli random variables with parameter 1/2. The lower-tail Hoeffding inequality implies that the fraction of vertices at distance at most an, 0<a<1/2, is at most e−2n(1/2−a)2. Strict-radius balls satisfy the same upper bound.

 Ancestors (8)

  1. Hamming ball
  2. Hamming distance
  3. Binary block code
  4. Coding theory
  5. Algebra
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Exponential packing of a Hamming cube
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 36 / 3 / 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