This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n13http://demonstrations.wolfram.com/CorrectionTrees/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Stack_search
dbo:wikiPageWikiLink
dbr:Sequential_decoding
Subject Item
dbr:Robert_Fano
dbo:wikiPageWikiLink
dbr:Sequential_decoding
dbp:knownFor
dbr:Sequential_decoding
dbo:knownFor
dbr:Sequential_decoding
Subject Item
dbr:Convolutional_code
dbo:wikiPageWikiLink
dbr:Sequential_decoding
Subject Item
dbr:John_Wozencraft
dbo:wikiPageWikiLink
dbr:Sequential_decoding
Subject Item
dbr:Viterbi_decoder
dbo:wikiPageWikiLink
dbr:Sequential_decoding
Subject Item
dbr:Sequential_decoding
rdf:type
dbo:TopicalConcept
rdfs:label
Sequential decoding
rdfs:comment
Recognised by John Wozencraft, sequential decoding is a limited memory technique for decoding . Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach may not be as accurate as the Viterbi algorithm but can save a substantial amount of computer memory. It was used to decode a convolutional code in 1968 Pioneer 9 mission. Sequential decoding explores the tree code in such a way to try to minimise the computational cost and memory requirements to store the tree. * Fano metric * Zigangirov metric * Gallager metric
dcterms:subject
dbc:Error_detection_and_correction
dbo:wikiPageID
25258521
dbo:wikiPageRevisionID
1066542638
dbo:wikiPageWikiLink
dbr:Binary_symmetric_channel dbr:John_Wozencraft dbr:Bayes_theorem dbr:Code_rate dbr:Likelihood dbc:Error_detection_and_correction dbr:Tree_codes dbr:Probability dbr:Prior_probability dbr:Pioneer_9 dbr:Robert_Fano dbr:Hamming_distance dbr:Viterbi_algorithm dbr:Convolutional_code
dbo:wikiPageExternalLink
n13:
owl:sameAs
wikidata:Q7452500 n10:4utHy freebase:m.09gqn3d
dbp:wikiPageUsesTemplate
dbt:Var dbt:Isbn
dbo:abstract
Recognised by John Wozencraft, sequential decoding is a limited memory technique for decoding . Sequential decoding is mainly used as an approximate decoding algorithm for long constraint-length convolutional codes. This approach may not be as accurate as the Viterbi algorithm but can save a substantial amount of computer memory. It was used to decode a convolutional code in 1968 Pioneer 9 mission. Sequential decoding explores the tree code in such a way to try to minimise the computational cost and memory requirements to store the tree. There is a range of sequential decoding approaches based on the choice of metric and algorithm. Metrics include: * Fano metric * Zigangirov metric * Gallager metric Algorithms include: * Stack algorithm * Fano algorithm * Creeper algorithm
gold:hypernym
dbr:Technique
prov:wasDerivedFrom
wikipedia-en:Sequential_decoding?oldid=1066542638&ns=0
dbo:wikiPageLength
6763
foaf:isPrimaryTopicOf
wikipedia-en:Sequential_decoding
Subject Item
dbr:Fano_algorithm
dbo:wikiPageWikiLink
dbr:Sequential_decoding
dbo:wikiPageRedirects
dbr:Sequential_decoding
Subject Item
dbr:Fano_metric
dbo:wikiPageWikiLink
dbr:Sequential_decoding
dbo:wikiPageRedirects
dbr:Sequential_decoding
Subject Item
dbr:Sequential_decoder
dbo:wikiPageWikiLink
dbr:Sequential_decoding
dbo:wikiPageRedirects
dbr:Sequential_decoding
Subject Item
wikipedia-en:Sequential_decoding
foaf:primaryTopic
dbr:Sequential_decoding