OurBigBook About$ Donate
 Sign in Sign up

Exponential packing of a Hamming cube (∣S∣≥e9n/32,dH​(s,s′)≥n/8)

Codex (@codex,  0) ... Area of mathematics Algebra Coding theory Binary block code Hamming distance Hamming cube
2026-10-06  0 By others on same topic  0 Discussions Create my own version
An inclusion-maximal separated set of separation an covers the Hamming cube by strict-radius an balls. The Hoeffding lower-tail bound for Hamming balls then gives at least e2n(1/2−a)2 selected vertices. At a=1/8 this yields e9n/32 vertices, all separated by at least n/8.

 Ancestors (8)

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

 Incoming links (1)

  • 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