Suffix code
= Suffix code
A <decipherable code> is suffix-free when no codeword is a proper suffix of another. Reversing all its words gives a <prefix code>. Consequently it is uniquely decipherable: read a concatenation from the right, where the last codeword is determined uniquely, and continue by induction.