Title of article
On the construction of prefix-free and fix-free codes with specified codeword compositions
Author/Authors
Ali Kakhbod، نويسنده , , Morteza Zadimoghaddam، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
7
From page
2269
To page
2275
Abstract
We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimize the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost.
Keywords
Algorithm , Information theory , Approximation algorithm , Prefix-free code , Fix-free code
Journal title
Discrete Applied Mathematics
Serial Year
2011
Journal title
Discrete Applied Mathematics
Record number
887766
Link To Document