Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Electronic Integrated Computer Algorithm Journal

Comparative Analysis of Huffman Coding Implementations for Efficient Data Communication Using Greedy and Divide-and-Conquer Techniques Frye, Kaleb; Ronhovde, Josh; Stonestreet, Connor; Fazea, Yousef
Electronic Integrated Computer Algorithm Journal Vol. 2 No. 1 (2024): VOLUME 2, NO 1: OCTOBER 2024
Publisher : Yayasan Asmin Intelektual Berkah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62123/enigma.v2i1.24

Abstract

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.