| Display title | Gilbert–Varshamov bound for linear codes |
| Default sort key | Gilbert-Varshamov bound for linear codes |
| Page length (in bytes) | 8,341 |
| Namespace ID | 0 |
| Page ID | 31694741 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Wikidata item ID | Q5514839 |
| Central description | theorem in coding theory |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | JavaDfan (talk | contribs) |
| Date of page creation | 15:58, 6 May 2011 |
| Latest editor | David Eppstein (talk | contribs) |
| Date of latest edit | 21:34, 28 February 2025 |
| Total number of edits | 54 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (5) | This page is a member of 5 hidden categories (help):
|
| Transcluded templates (38) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
