Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Sardinas–Patterson_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Sardinas–Patterson_algorithm abstract "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.".
- Sardinas–Patterson_algorithm wikiPageID "23632960".
- Sardinas–Patterson_algorithm wikiPageRevisionID "573378021".
- Sardinas–Patterson_algorithm subject Category:Algorithms.
- Sardinas–Patterson_algorithm subject Category:Coding_theory.
- Sardinas–Patterson_algorithm subject Category:Data_compression.
- Sardinas–Patterson_algorithm comment "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.".
- Sardinas–Patterson_algorithm label "Sardinas–Patterson algorithm".
- Sardinas–Patterson_algorithm sameAs Sardinas%E2%80%93Patterson_algorithm.
- Sardinas–Patterson_algorithm sameAs Q7423792.
- Sardinas–Patterson_algorithm sameAs Q7423792.
- Sardinas–Patterson_algorithm wasDerivedFrom Sardinas–Patterson_algorithm?oldid=573378021.