This is a simple implementation of sardinas-patterson algorithm based on the publication:
A Fast Test for Unique Decipherability Based on Suffix Trees, Michael Rodeh IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-28, NO. 4, JULY 1982
The input is a set of words C which is tested for unique decipherability.