Download the Free Fishpond App!
Download on the App Store

Android App on Google play
Sardinas-Patterson Algorithm

Already own it?

Sell Yours
Home » Books » Science » Mathematics » General

Sardinas-Patterson Algorithm

By Lambert M Surhone (Edited by), Mariam T Tennoe (Edited by), Susan F Henssonow (Edited by)

We need to confirm pricing for this item.

We will email you if this item comes back into stock.

Register or sign-in to rate and get recommendations.
Format: Paperback / softback, 116 pages
Published In: United States, 19 November 2010
High Quality Content by WIKIPEDIA articles! In coding theory, the Sardinas-Patterson algorithm is a classical algorithm for determining whether a given variable-length code is uniquely decodable. 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.Since all sets Si are sets of suffixes of a finite set of codewords, there are only finitely many different candidates for Si. Since visiting one of the sets for the second time will cause the algorithm to stop, the algorithm cannot continue endlessly and thus must always terminate. A proof that the algorithm is correct, i.e. that it always gives the correct answer, is found in the textbooks by Salomaa and by Berstel et al.
EAN: 9786131152887
ISBN: 6131152888
Publisher: Betascript Publishing
Dimensions: 15 x 22 centimetres (0.18 kg)
Age Range: 15+ years
Tell a friend

Their Email:

Sell Yours

Already own this item?
Sell Yours and earn some cash. It's fast and free to list! (Learn More.)


Review this Product


Related Searches

This title is unavailable for purchase as none of our regular suppliers have stock available. If you are the publisher, author or distributor for this item, please visit this link.