In search for the simplest example that proves Huffman coding overperforms Shannon-Fano coding

Breazu Macarie (), Morariu Daniel I. (), Crețulescu Radu G. (), Pitic Antoniu G. () and Bărglăzan Adrian A. ()
Additional contact information
Breazu Macarie: Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania
Morariu Daniel I.: Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania
Crețulescu Radu G.: Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania
Pitic Antoniu G.: Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania
Bărglăzan Adrian A.: Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania

International Journal of Advanced Statistics and IT&C for Economics and Life Sciences, 2022, vol. 12, issue 2, 3-10

Abstract: Shannon-Fano coding (SFC) and Huffman coding (HC) are classic and well-known algorithms, but still in use today. The search for the simplest example that proves HC overperforms SFC is still of interest. The problem is not as trivial as it looks like at first view because of several decisions that must be considered. We perform a full-search of the stream data space for a maximum stream length of 100. Depending on additional requests we impose, the simplest solution we found is {1,1,1,1,3} when we accept to select a specific cutting, {2,3,3,3,7} when we accept only deterministic (unique) cuttings and {4,5,6,7,14} when we also ask for different frequencies for symbols as well.

Keywords: Shannon-Fano; Huffman; coding; simplest example (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.2478/ijasitels-2022-0001 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vrs:ijsiel:v:12:y:2022:i:2:p:3-10:n:7

DOI: 10.2478/ijasitels-2022-0001

Access Statistics for this article

International Journal of Advanced Statistics and IT&C for Economics and Life Sciences is currently edited by Daniel Volovici

More articles in International Journal of Advanced Statistics and IT&C for Economics and Life Sciences from Sciendo
Bibliographic data for series maintained by Peter Golla ().