The generic Huffman-Encoding Problem of finding a minimum cost prefix-free code is almost completely understood. There still exist many variants of this problem which are not as well understood, though. One such variant, requiring that each of the codewords ends with a “1,” has recently been introduced in the literature with the best algorithms known for finding such codes running in exponentia...

Algoritme Huffman dan Weaven-Hankamer adalah dua algoritme pengodean sumber yang diterapkan secara umum untuk teks. Kedua ini membutuhkan lebih banyak waktu menyelesaikan prosesnya karena memiliki tahapan. Oleh itu, penelitian bertujuan membuat user interface menggunakan MATLAB dapat menyimulasikan proses kedua mampu memberikan hasil sangat akurat dengan cepat. Ada skenario pada ini. Terdapat d...

One-shot coding and repeated coding are considered for the class of almost instantaneous variable-to-fixed length (AIVF) codes, AIVF, which includes some nonproper VF codes in addition to the class of proper VF codes, PVF. An algorithm is given to construct the average-sense optimal (a-optimal) AIVF code in one-shot coding that attains the maximum average parse length in AIVF. The algorithm can...

This paper proposes two stage algorithm that carries advantages of PDLZW and Arithmetic coding and compares its performance with deflate which is a well-known two-stage algorithm that combines the features of LZ77 and Huffman Coding. The PDLZW is designed by partitioning the dictionary into several dictionaries of different address spaces and sizes. With the hierarchical parallel dictionary set...

We know that large amount of data and information should be transmitted through internet during transactions in E-Governance. Smart E-Governance system should deliver speedy, space efficient, cost effective and secure services among other governments and its citizens utilizing benefits of Information and Communication Technologies (ICT). This paper proposes to develop a space efficient and secu...

3 Probability Coding 10 3.1 Prefix Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.1 Relationship to Entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 Huffman Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.1 Combining Messages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2.2 Minim...

A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations using an improved simplification method, in which each level of the mesh can be refined into the next level by carrying out a group of vertex split operations in any order. Consequently, the PM representation can be eff...