2021/05/14 by Ioannis S. Xezonakis, Xezonakis, Ioannis S., Svoronos Leivadaros +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #Cancer-related molecular mechanisms research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Theory (cs.IT) #Natural Language Processing Techniques
paper · pdf · doi:10.48550/arxiv.2105.07073
openalex publication_date 2021/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we implement an n-ary Huffman Encoding and Decoding application\nusing different degrees of tree structures. Our goal is to compare the\nperformance of the algorithm in terms of compression ratio, decompression speed\nand weighted path length when using higher degree trees, compared to the 2-ary\nHuffman Code. The Huffman tree degrees that we compare are 2-ary, 3-ary, 4-ary,\n5-ary, 6-ary, 7-ary, 8-ary and 16-mal. We also present the impact that branch\nprediction has on the performance of the n-ary Huffman Decoding.\n