An algorithm for construction of efficient fix-free codes
Ksenija Lakovic, John D. Villasenor · IEEE Communications Letters · 2003
We propose an algorithm for construction of fix-free codes, which involves a new codeword selection mechanism. Starting from the shortest codewords, the proposed algorithm selects fix-free codewords of any length i with respect to maximizing the number of available codewords of length i+1. Due to the increased fix-free codeword availability, the proposed algorithm constructs the codes of higher efficiency relative to the other algorithms in the literature.