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 165.230.224.73 (talk) at 08:56, 29 March 2016 (Created page with '==Formal Proof== In the formal proof, it says that the size of $G$ is $kn$, does this means $k\times n$? ~~~~'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]