| Display title | Gilbert–Varshamov bound |
| Default sort key | Gilbert-Varshamov Bound |
| Page length (in bytes) | 3,781 |
| Namespace ID | 0 |
| Page ID | 178180 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Rtextdoc |
| Date of page creation | 20:49, 6 February 2024 |
| Latest editor | imported>Rtextdoc |
| Date of latest edit | 20:49, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In coding theory, the Gilbert–Varshamov bound (due to Edgar Gilbert and independently Rom Varshamov) is a bound on the size of a (not necessarily linear) code. It is occasionally known as the Gilbert–Shannon–Varshamov bound (or the GSV bound), but the name "Gilbert–Varshamov bound" is by far the most... |
