Optimizing 4-ary Huffman Trees and Normalizing Binary Code Structures to Minimize Redundancy and Level Reduction

Publication Name : Elinvo (Electronics, Informatics, and Vocational Education) 10 (1), 63-77, 2025

Citation :

Date : 2025


Publication URL
https://scholar.google.com/scholar?q=+intitle:"Optimizing 4-ary Huffman Trees and Normalizing Binary Code Structures to Minimize Redundancy and Level Reduction"