preprint · 2017

Huffman Text Compression Technique

Cited by 8Abstract and details only

Abstract

Huffman is one of the compression algorithms. It is the most famous algorithm to compress text. There are four phases in the Huffman algorithm to compress text. The first is to group the characters. The second is to build the Huffman tree. The third is the encoding, and the last one is the construction of coded bits. The Huffman algorithm principle is the character that often appears on encoding with a series of short bits and characters that rarely appeared in bit-encoding with a longer series. Huffman compression technique can provide savings of 30% from the original bits. It works based on the frequency of characters. The more the similar character reached, the higher the compression rate gained.

Cite this paper

APA 7

Siahaan, A. P. U. (2017). Huffman Text Compression Technique. https://doi.org/10.31227/osf.io/mztc6

MLA 9

Siahaan, Andysah Putera Utama. “Huffman Text Compression Technique.” 2017, https://doi.org/10.31227/osf.io/mztc6.

Chicago

Siahaan, Andysah Putera Utama. 2017. “Huffman Text Compression Technique.” https://doi.org/10.31227/osf.io/mztc6.

Harvard

Siahaan, A.P.U. (2017) ‘Huffman Text Compression Technique’. Available at: https://doi.org/10.31227/osf.io/mztc6.

BibTeX

@misc{siahaan2017huffman,
  title = {{Huffman Text Compression Technique}},
  author = {Siahaan, Andysah Putera Utama},
  year = {2017},
  doi = {10.31227/osf.io/mztc6}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.