INFOKUM
Vol. 10 No. 5 (2022): December, Computer and Communication

IMPLEMENTATION OF HUFFMAN AND LZ78 ALGORITHM FOR CHARACTER COMPRESSION

Chairul Imam (Department Of Information Technology, Department Of Informatics Universitas Battuta)
Muhammad Furqon Siregar (Department Of Information Technology, Department Of Informatics Universitas Battuta)

Article Info

Publish Date
09 Dec 2022

Abstract

The Huffman algorithm is a time complexity of 0(n log n), because the Huffman algorithm performs one iteration process when merging two trees that have the smallest frequency at a root takes 0(log n), and the process is done many times until only there is only one tree left with a combination of the LZ78 algorithm using a dictionary technique in compressing one of the characters in the form of a string replaced by a table code that is made for reference in extended ASCII in inputting characters or strings.

Copyrights © 2022




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
INFOKUM
Website

Abbrev

infokum

Publisher

SEAN INSTITUTE

Subject

Computer Science & IT

Description

The INFOKUM a scientific journal of Decision support sistem , expert system and artificial inteligens which includes scholarly writings on pure research and applied research in the field of information systems and information technology as well as a review-general review of the development of the ...