A note on uniquely decipherable codes (Corresp.)
Renato M. Capocelli · IEEE Transactions on Information Theory · 1979
A simple and complete analysis is given for establishing whether a code is uniquely decipherable, has finite delay, or is synchronizable. The conditions are based on certain combinatorial properties of the codewords and are such that for a finite code there exists an effective procedure for testing the properties in question.