Stručni rad

AN APPLICATION OF PLANAR BINARY BITREES TO PREFIX AND HUFFMAN PREFIX CODE

Zlatko Erjavec orcid.org/0000-0002-9402-1069 ; Faculty of Organization and Informatics, University of Zagreb, Varaždin, Croatia

Sažetak

In this paper we construct prefix code in which the use of planar binary trees is replaced by the use of the planar binary bitrees. In addition, we apply the planar binary bitrees to the Huffman prefix code. Finally, we code English alphabet in such a way that characters have codewords different from already established ones.

Ključne riječi

planar binary bitree; Huffman prefix code

Hrčak ID:

78307

URI

https://hrcak.srce.hr/78307

Datum izdavanja:

15.12.2004.

Posjeta: 735 *