Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q625117> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q625117 subject Q6542000.
- Q625117 abstract "The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). The algorithm is named after its inventors: Bahl, Cocke, Jelinek and Raviv. This algorithm is critical to modern iteratively-decoded error-correcting codes including turbo codes and low-density parity-check codes.".
- Q625117 wikiPageExternalLink itila.
- Q625117 wikiPageExternalLink susalib.org.
- Q625117 wikiPageExternalLink L360.
- Q625117 wikiPageWikiLink Q1395022.
- Q625117 wikiPageWikiLink Q176769.
- Q625117 wikiPageWikiLink Q187444.
- Q625117 wikiPageWikiLink Q2164281.
- Q625117 wikiPageWikiLink Q3497144.
- Q625117 wikiPageWikiLink Q353292.
- Q625117 wikiPageWikiLink Q446862.
- Q625117 wikiPageWikiLink Q4909.
- Q625117 wikiPageWikiLink Q635384.
- Q625117 wikiPageWikiLink Q6542000.
- Q625117 wikiPageWikiLink Q863510.
- Q625117 wikiPageWikiLink Q989220.
- Q625117 comment "The BCJR algorithm is an algorithm for maximum a posteriori decoding of error correcting codes defined on trellises (principally convolutional codes). The algorithm is named after its inventors: Bahl, Cocke, Jelinek and Raviv. This algorithm is critical to modern iteratively-decoded error-correcting codes including turbo codes and low-density parity-check codes.".
- Q625117 label "BCJR algorithm".