Have a personal or library account? Click to login
In search for the simplest example that proves Huffman coding overperforms Shannon-Fano coding Cover

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

Open Access
|Jan 2023

Authors

Macarie Breazu

macarie.breazu@ulbsibiu.ro

Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania

Daniel I. Morariu

daniel.morariu@ulbsibiu.ro

Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania

Radu G. Crețulescu

radu.cretulescu@ulbsibiu.ro

Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania

Antoniu G. Pitic

antoniu.pitic@ulbsibiu.ro

Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania

Adrian A. Bărglăzan

adrian.barglazan@ulbsibiu.ro

Computer Science and Electrical and Electronics Engineering Department, Faculty of Engineering, “Lucian Blaga” University of Sibiu, Romania
DOI: https://doi.org/10.2478/ijasitels-2022-0001 | Journal eISSN: 2559-365X | Journal ISSN: 2067-354X
Language: English
Page range: 3 - 10
Published on: Jan 5, 2023
Published by: Lucian Blaga University of Sibiu
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2023 Macarie Breazu, Daniel I. Morariu, Radu G. Crețulescu, Antoniu G. Pitic, Adrian A. Bărglăzan, published by Lucian Blaga University of Sibiu
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.