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.; Bărglăzan, Adrian A.

doi:10.2478/ijasitels-2022-0001

References

[1] Shannon, C. E. A mathematical theory of communication, The Bell System Technical Journal, Volume: 27, Issue: 3, page 379 – 423, October 194810.1002/j.1538-7305.1948.tb01338.x
Search in Google Scholar Back to article
[2] Fano, R. M. The transmission of information, Research Laboratory of Electronics, Mass. Inst. of Techn. (MIT), Technical Report No. 65, Mar. 17, 194910.1119/1.1989587
Search in Google Scholar Back to article
[3] Huffman, D. A. A method for the construction of minimum-redundancy codes, Proceedings of the IRE, vol. 40, no. 9, pp. 1098–1101, Sept. 195210.1109/JRPROC.1952.273898
Search in Google Scholar Back to article
[4] Viraktamath, S. V., Koti, M. V., Bamagod, M. M. Performance analysis of source coding techniques, 2017 International Conference on Computing Methodologies and Communication (ICCMC), pp. 689-692, 201710.1109/ICCMC.2017.8282554
Search in Google Scholar Back to article
[5] Krajči S., Liu, C. -F., Mikeš, L., Moser, S.M. Performance analysis of Fano coding, 2015 IEEE International Symposium on Information Theory (ISIT), pp. 1746-1750, 201510.1109/ISIT.2015.7282755
Search in Google Scholar Back to article
[6] Sayood K. Introduction to Data Compression, Morgan Kaufmann, ISBN 0128094745, 201710.1016/B978-0-12-809474-7.00001-X
Search in Google Scholar Back to article
[7] https://pkware.cachefly.net/webdocs/APPNOTE/APPNOTE-6.3.9.TXT
Search in Google Scholar Back to article
[8] https://en.wikipedia.org/wiki/Huffman_coding#Applications
Search in Google Scholar Back to article
[9] https://en.wikipedia.org/wiki/Shannon%E2%80%93Fano_coding
Search in Google Scholar Back to article

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

References

Paradigm

My account