Are Huffman codes self-synchronizing?
Assume 256 symbols, each with probability 1/256. The Huffman code words will be all 256 possible eight-bit sequences, and there is no synchronisation at all. 

To find if a Huffman code is self-synchronising: 

Let S = {}
For each code c:
    For 1 ≤ m &lt; length (c)
        Let s be the last m bits of c
        As long as s has a code c' as prefix
            Remove prefix c' from s
        If s is not empty and not in S
            Add s to S.

Loop:
    If S is empty the the code is self-synchronising.
    Let T = {}
    For each s' in S, and code c:
        Let s be s' concatenated with c
        As long as s has a code c' as prefix
            Remove prefix c' from s
        If s is not empty and not in T
            Add s to T.
    If T = S then the code is not self-synchronising
    Let S = T and loop.