Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
