Jump to content

Talk:Gilbert–Varshamov bound for linear codes

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 18:09, 31 January 2019 (Michael Hardy moved page Talk:Gilbert-Varshamov bound for linear codes to Talk:Gilbert–Varshamov bound for linear codes: WP:MOS). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Formal Proof

In the formal proof, it says that the size of $G$ is $kn$, does this means $k\times n$? 165.230.224.73 (talk) 08:56, 29 March 2016 (UTC)[reply]

also, what is the reference for the proof? 165.230.224.73 (talk) 09:19, 29 March 2016 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Gilbert–Varshamov_bound_for_linear_codes&oldid=881138435"