Regular universal codeword sets (Corresp.)
Renato M. Capocelli, Alfredo De Santis · IEEE Transactions on Information Theory · 1986
Proof is given that no regular or synchronizable universal codeword sets can achieve optimality. Some asymptotic properties of a remarkable class of regular codeword sets related to the Fibonacci representation of integers are also obtained.