The Optimal Fix-Free Code for Anti-Uniform Sources
An \(n\) symbol source which has a Huffman code with codelength vector \(L_{n}=(1,2,3,\cdots,n-2,n-1,n-1)\) is called an anti-uniform source. In this paper, it is shown that for this class of sources, the optimal fix-free code and symmetric fix-free code is \( C_{n}^{*}=(0,11,101,1001,\cdots,1\over...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2015-03-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/17/3/1379 |