Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques
Electronic Integrated Computer Algorithm Journal · 2024
DOI: 10.62123/enigma.v2i1.24 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Integrated Computer Algorithm Journal, 2024. Verfasst von Kaleb Frye und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).
Abstract (Originalsprache)
Efficient data compression techniques are required to minimize storage and processing overhead due to modern systems' growing amount of data. Huffman Coding is a lossless compression technique that maintains data integrity by assigning shorter bit codes to characters appearing frequently, reducing size. Our analysis focuses on two implementation methodologies: greedy technique and divide and conquer. To find efficient solutions, divide-and-conquer algorithms partition problems into smaller components. In contrast, greedy algorithms strive to attain the utmost attainable result at each level. Our extensive investigation centers on the timing and space intricacies of diverse methodologies, enabling a comparative analysis that underscores their respective merits and drawbacks.
Zitieren
APA
Frye, K., Ronhovde, J., Stonestreet, C., & Fazea, Y. (2024). Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques. Electronic Integrated Computer Algorithm Journal. https://doi.org/10.62123/enigma.v2i1.24
Vancouver
Frye K, Ronhovde J, Stonestreet C, Fazea Y. Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques. Electronic Integrated Computer Algorithm Journal. 2024. doi:10.62123/enigma.v2i1.24
BibTeX
@article{Frye2024,
author = {Frye, Kaleb and Ronhovde, Josh and Stonestreet, Connor and Fazea, Yousef},
title = {Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques},
journal = {Electronic Integrated Computer Algorithm Journal},
year = {2024},
doi = {10.62123/enigma.v2i1.24}
}
EUVIMED