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

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

Namespace Prefixes

PrefixIRI
n10http://dbpedia.org/resource/Wikt:
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n17http://www-igm.univ-mlv.fr/~berstel/LivreCodes/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbpedia-frhttp://fr.dbpedia.org/resource/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
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:Timeline_of_information_theory
dbo:wikiPageWikiLink
dbr:Sardinas–Patterson_algorithm
Subject Item
dbr:Sardinas-Patterson_algorithm
dbo:wikiPageWikiLink
dbr:Sardinas–Patterson_algorithm
dbo:wikiPageRedirects
dbr:Sardinas–Patterson_algorithm
Subject Item
dbr:Variable-length_code
dbo:wikiPageWikiLink
dbr:Sardinas–Patterson_algorithm
Subject Item
dbr:Sardinas–Patterson_algorithm
rdf:type
yago:Act100030358 yago:Abstraction100002137 yago:Algorithm105847438 yago:Event100029378 yago:YagoPermanentlyLocatedEntity yago:PsychologicalFeature100023100 dbo:Software yago:Procedure101023820 yago:Activity100407535 yago:WikicatAlgorithms yago:Rule105846932
rdfs:label
Sardinas–Patterson algorithm Algorithme de Sardinas-Patterson
rdfs:comment
En théorie des codes, l'algorithme de Sardinas-Patterson permet de déterminer si une partie d'un monoïde libre est un code en temps polynomial. Il est nommé d'après August Sardinas et George Patterson, qui le publièrent dans un article de 1953. In coding theory, the Sardinas–Patterson algorithm is a classical algorithm for determining in polynomial time whether a given variable-length code is uniquely decodable, named after August Albert Sardinas and George W. Patterson, who published it in 1953. The algorithm carries out a systematic search for a string which admits two different decompositions into codewords. As Knuth reports, the algorithm was rediscovered about ten years later in 1963 by Floyd, despite the fact that it was at the time already well known in coding theory.
dcterms:subject
dbc:Algorithms dbc:Coding_theory dbc:Data_compression
dbo:wikiPageID
23632960
dbo:wikiPageRevisionID
1110849198
dbo:wikiPageWikiLink
dbc:Algorithms dbr:Variable-length_code dbr:Donald_Knuth dbr:Coding_theory dbr:Nondeterministic_Turing_machine dbr:Prefix_code dbr:Recursive_definition n10:terminate dbr:Institute_of_Radio_Engineers dbr:NL-complete dbr:Formal_language dbr:Prefix_(computer_science) dbc:Coding_theory dbr:Quotient_of_a_formal_language dbr:Suffix_tree dbr:Correctness_(computer_science) dbr:Suffix_(computer_science) dbr:Cambridge_University_Press dbr:Polynomial_time dbr:Robert_W._Floyd dbr:Robert_G._Gallager dbr:Block_code dbr:Empty_word dbr:Kraft's_inequality dbr:Arto_Salomaa dbr:NL_(complexity) dbc:Data_compression dbr:Timeline_of_information_theory
dbo:wikiPageExternalLink
n17:Codes.html
owl:sameAs
dbpedia-fr:Algorithme_de_Sardinas-Patterson wikidata:Q7423792 n18:4uRiX freebase:m.06znp8_
dbp:wikiPageUsesTemplate
dbt:Cite_book dbt:Sfnp dbt:Citation dbt:Cite_journal
dbo:abstract
En théorie des codes, l'algorithme de Sardinas-Patterson permet de déterminer si une partie d'un monoïde libre est un code en temps polynomial. Il est nommé d'après August Sardinas et George Patterson, qui le publièrent dans un article de 1953. In coding theory, the Sardinas–Patterson algorithm is a classical algorithm for determining in polynomial time whether a given variable-length code is uniquely decodable, named after August Albert Sardinas and George W. Patterson, who published it in 1953. The algorithm carries out a systematic search for a string which admits two different decompositions into codewords. As Knuth reports, the algorithm was rediscovered about ten years later in 1963 by Floyd, despite the fact that it was at the time already well known in coding theory.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Sardinas–Patterson_algorithm?oldid=1110849198&ns=0
dbo:wikiPageLength
9053
foaf:isPrimaryTopicOf
wikipedia-en:Sardinas–Patterson_algorithm
Subject Item
dbr:NL-complete
dbo:wikiPageWikiLink
dbr:Sardinas–Patterson_algorithm
Subject Item
wikipedia-en:Sardinas–Patterson_algorithm
foaf:primaryTopic
dbr:Sardinas–Patterson_algorithm