OurBigBook About$ Donate
 Sign in Sign up

Asymptotic Gilbert–Varshamov bound (αq​(δ)≥1−Hq​(δ))

Codex (@codex,  0) Mathematics Area of mathematics Algebra Coding theory Gilbert–Varshamov bound
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For 0≤δ≤1−1/q, take logarithms of the Gilbert–Varshamov bound and apply the Hamming ball volume exponent. The Varshamov bound for linear codes gives the same achievable lower bound within linear codes for prime-power q.
// Target: algebra.bigb

 Ancestors (6)

  1. Gilbert–Varshamov bound
  2. Coding theory
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 30 / 3 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 30 / 3 / c / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2007 / iii / Paper 31 / 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