Computer Science – Information Theory
Scientific paper
2010-01-30
Discrete Applied Mathematics (DAM). vol. 159, no. 18, pp 2269-2275, 2011
Computer Science
Information Theory
Scientific paper
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 minimizes 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.
Kakhbod Ali
Zadimoghaddam Morteza
No associations
LandOfFree
On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-346899