In coding theory, the Sardinas–Patterson algorithm is a classic... - dofaq.com
sardinas–patterson algorithm

In coding theory, the Sardinas–Patterson algorithm is a classic...

wikipedia - 07 Nov 2016
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 a

What's New