Matches in DBpedia 2014 for { <http://dbpedia.org/resource/GV-linear-code> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- GV-linear-code abstract "In coding theory, the bound of parameters such as rate R, relative distance, block length, etc. is usually concerned. Here Gilbert–Varshamov bound theorem claims the lower bound of the rate of the general code. Gilbert–Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.[citation needed]".
- GV-linear-code wikiPageExternalLink codingtheory.
- GV-linear-code wikiPageExternalLink coding-theory.
- GV-linear-code wikiPageExternalLink lect9.pdf.
- GV-linear-code wikiPageID "31694741".
- GV-linear-code wikiPageRevisionID "577157812".
- GV-linear-code hasPhotoCollection GV-linear-code.
- GV-linear-code subject Category:Coding_theory.
- GV-linear-code comment "In coding theory, the bound of parameters such as rate R, relative distance, block length, etc. is usually concerned. Here Gilbert–Varshamov bound theorem claims the lower bound of the rate of the general code. Gilbert–Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.[citation needed]".
- GV-linear-code label "GV-linear-code".
- GV-linear-code sameAs m.0gmcfll.
- GV-linear-code sameAs Q5514839.
- GV-linear-code sameAs Q5514839.
- GV-linear-code wasDerivedFrom GV-linear-code?oldid=577157812.
- GV-linear-code isPrimaryTopicOf GV-linear-code.