An algorithm for construction of efficient fix-free codes

doi:10.1109/LCOMM.2003.815660

2003-08-01

PRE

Lakovic, K

Villasenor, J

DOI：10.1109/LCOMM.2003.815660

原文链接

原文求助

摘要

En 中文

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.

Keyword:

fix-free codes

Huffman codes

prefix codes

reversible variable length codes (RVLCs)