Kompresi data menggunakan algoritma huffman

dc.contributor.author	Adisantoso, Julio
dc.contributor.author	SuHstio, Danny Dimas
dc.contributor.author	Silalahi, Bib Paruhurn
dc.date.accessioned	2012-11-14T04:45:14Z
dc.date.available	2012-11-14T04:45:14Z
dc.date.issued	2004
dc.identifier.issn	0853-8697
dc.identifier.uri	http://repository.ipb.ac.id/handle/123456789/58465
dc.description.abstract	Text compression algorithms are normally defined in terms of a source alphabet of 8- bit ASCII codes. HJ1ffman algorithm is the most popular methods of text compression. This research used static and adaptif Huffman algorithms to compress text data, and also compare it. Variation of character occurs will decrease compression ratio. Iteration time of static Huffman algorithm for compress and decompress is faster than adapiif Huffman algorithm, but performance of adaptij Huffman algorithm is best	en
dc.publisher	Fakultas Teknologi Industri Universitas Islam Indonesia
dc.relation.ispartofseries	Edisi khusus;
dc.subject	text compression,	en
dc.subject	static,	en
dc.subject	and adaptif huffman algorithm.	en
dc.title	Kompresi data menggunakan algoritma huffman	en
dc.type	Article	en