Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7573792> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q7573792 subject Q6542000.
- Q7573792 subject Q7451729.
- Q7573792 abstract "A Sparse graph code is a code which is represented by a sparse graph.Any linear code can be represented as a graph, where there are two sets of nodes - a set representing the transmitted bits and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical error-correcting codes are based on sparse graphs, achieving close to the Shannon limit. The archetypal sparse-graph codes are Gallager's low-density parity-check codes.".
- Q7573792 wikiPageExternalLink itila.
- Q7573792 wikiPageExternalLink ?site_locale=en_GB.
- Q7573792 wikiPageExternalLink data.html.
- Q7573792 wikiPageWikiLink Q1752667.
- Q7573792 wikiPageWikiLink Q187444.
- Q7573792 wikiPageWikiLink Q188889.
- Q7573792 wikiPageWikiLink Q2345282.
- Q7573792 wikiPageWikiLink Q3085841.
- Q7573792 wikiPageWikiLink Q446862.
- Q7573792 wikiPageWikiLink Q461687.
- Q7573792 wikiPageWikiLink Q6542000.
- Q7573792 wikiPageWikiLink Q7451729.
- Q7573792 wikiPageWikiLink Q8805.
- Q7573792 wikiPageWikiLink Q989220.
- Q7573792 comment "A Sparse graph code is a code which is represented by a sparse graph.Any linear code can be represented as a graph, where there are two sets of nodes - a set representing the transmitted bits and another set representing the constraints that the transmitted bits have to satisfy. The state of the art classical error-correcting codes are based on sparse graphs, achieving close to the Shannon limit. The archetypal sparse-graph codes are Gallager's low-density parity-check codes.".
- Q7573792 label "Sparse graph code".