Next Article in Journal
Applied Cryptography Using Chaos Function for Fast Digital Logic-Based Systems in Ubiquitous Computing
Previous Article in Journal
Hidden State Conditional Random Field for Abnormal Activity Recognition in Smart Homes
Open AccessArticle

The Optimal Fix-Free Code for Anti-Uniform Sources

1
Department of Mathematics and Cryptography, Malek Ashtar University of Technology, Isfahan 83145/115, Iran
2
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran
3
Department of Electrical and Computer Engineering, University of Victoria, PO Box 1700, STN CSC, Victoria, BC V8W 2Y2, Canada
*
Author to whom correspondence should be addressed.
Academic Editor: Raúl Alcaraz Martínez
Entropy 2015, 17(3), 1379-1386; https://doi.org/10.3390/e17031379
Received: 9 February 2015 / Accepted: 13 March 2015 / Published: 19 March 2015
(This article belongs to the Section Information Theory, Probability and Statistics)
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\overbrace{0\cdots0}^{n-2}1) \) View Full-Text
Keywords: prefix code; fix-free code; anti-uniform sources prefix code; fix-free code; anti-uniform sources
MDPI and ACS Style

Zaghian, A.; Aghajan, A.; Gulliver, T.A. The Optimal Fix-Free Code for Anti-Uniform Sources. Entropy 2015, 17, 1379-1386.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop