Gilbert–Varshamov bound
id:
gilbert-varshamov-bound-290-8326427
title:
Gilbert–Varshamov bound
text:
In coding theory, the Gilbert–Varshamov bound is a bound on the size of a code. It is occasionally known as the Gilbert–Shannon–Varshamov bound, but the name "Gilbert–Varshamov bound" is by far the most popular. Varshamov proved this bound by using the probabilistic method for linear codes. For more about that proof, see Gilbert–Varshamov bound for linear codes.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Gilbert%E2%80%93Varshamov_bound
date created:
date modified:
2023-12-26T18:05:38Z
main entity:
{"identifier":"Q2454864","url":"https://www.wikidata.org/entity/Q2454864"}
image:
fields total:
13
integrity:
13