Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,725 papers for “Huffman coding”

Huffman Coding

Alistair Moffat · Encyclopedia of Algorithms · 2016

Cited by 0

Huffman coding

Sunil S. Harakannanavar, H. Jayalaxmi, H Shridhar et al. · International Journal of Health Sciences · 2022

In the proposed Huffman LEACH model, energy consumption increases exponentially with distance and there are no maximum limits. The transmit power level of a sensor node can only be adjusted to discrete values that may result in one transmit power level for various distances. The resulting energy consumption for two links of different distances can be equivalent. The number of clusters generated in LEACH does not converge to a fixed value which shortens the lifespan of the network. The energy consumption of the wireless sensor network is inversely proportional to the lifetime of the wireless sensor network. Here, we assume that the network lifetime is defined as the time from the deployment of the WSN till the first gateway dies. Hence, network lifetime can be maximized by using the parameter discussed in this paper. If we can minimize the energy consumption of the CH nodes, then energy consumption of the sensor nodes can be minimized if we can minimize their relative distance from their corresponding CH’s. The experimental result of proposed model says better with its energy faster than the nodes with lower data transmission rate when compared with the existing WSN models.

Cited by 1Open access

Huffman coding application

Manuel Pleš · Repository of FERIT Osijek · 2020

U ovom završnom radu kreirana je iOS mobilna aplikacija za Huffmanovo kodiranje. Objašnjen je Huffmanov algoritam i alati koji se koriste za izradu aplikacije. Problem s kojim se susreće je pretvaranje koraka Huffmanovog algoritma u njihov ekvivalent u kodu i rješenje koje se nudi dano je u dva dijela. Prvi dio implementacije zadužen je za izradu Huffmanovog stabla koje u programu izgleda drugačije od običnog stabla, ali ima istu funkciju. Drugi dio zadužen je za prolazak i čitanje stabla i to je postignuto rekurzivnom funkcijom. Veliku ulogu u ostvarenju rješenja ovog problema ima mogućnost programskog jezika Swift da koristi tip podatka "Any" koji u potpunosti mijenja ulogu pokazivača. Cijeli proces sakriven je iza jednostavnog korisničkog sučelja koje omogućava korisniku upisivanje znakova koje želi kodirati i njihovo kodiranje pritiskom samo jednog dugmeta.

Cited by 0Open access

Huffman coding+decoding

? · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 1988

Atari 8 Bit on Atari 800 XL: one of the first ZIP tools that existed. Compresses files using Huffman algorythm. Using TURBO BASIC See https://en.wikipedia.org/wiki/Huffman_coding

Cited by 0

Huffman source coding

Huffman Source, Antti Koivula Supervisor, Antti-Heikki Tlli et al. · University of Oulu Repository (University of Oulu) · 2021

In this work, A Huffman source coding system is studied and implemented.The work will go through the basics of the source coding theorem, standard Huffman code is introduced, its weaknesses in a practical system are presented, and finally, methods and algorithms are introduced to overcome these weaknesses.In Particular, the preset dictionaries and Vitter algorithm are introduced.Then, the implementation is presented and the performance is studied by compressing text files.

Cited by 0Open access

Block huffman coding

M. Abdul Mannan, M. Kaykobad · Computers & Mathematics with Applications · 2003

Cited by 11

Enumerative Huffman coding

W. van der Walt, H.C. Ferreira · 2002

The efficiency of Huffman decoding is very important for an increased variety of implementations. A method called variable length enumerative table (VLET) decoding is presented which uses enumerative source coding principles to construct a Huffman decoder.

Cited by 1

Dynamic Huffman Coding

Jeffrey Scott Vitter · 1989

. We present a Pascal implementation of the one-pass algorithm for constructing dynamic Huffman codes that is described and analyzed in a companion paper [Vitter, 1987]. The program runs in real time

Cited by 0

STUDI BANDING ALGORITMA KOMPRESI HUFFMAN CODING DAN ADAPTIVE HUFFMAN CODING

METARIANA ADITYA, 103040047, Mellia Liyanthy, Ds · Universitas Pasundan institutional repositories & scientific journals (Universitas Pasundan) · 2017

ABSTRAK 
\n
\n 
\nAlgoritma kompresi menurut David Solomon (2007:2) adalah proses mengkonversikan sebuah
\ninput data stream (streamsumber, atau data mentah asli) menjadi data stream lainnya (bitstream hasil,
\natau stream yang telah terkompresi) yang berukuran lebih kecil. Berbagai tipe algoritma kompresi,
\nantara lain: Huffman, LIFO, LZHUF, LZ77 dan variannya ( LZ78, LZW, GZIP), Dynamic Markov
\nCompression (DMC), Block-SortingLossLess, Run-Length, Shannon-Fano, Arithmetic, PPM
\n(Prediction by PartialMatching), Burrows-Wheeler, Block Sorting, dan Half Byte. 
\nHuffman Coding dan Adaptive Huffman Coding adalah salah satu tipe algoritma kompresi
\nyang menjadi pokok bahasan dalam tugas akhir ini. Huffman Coding adalah sebuah tipe kode optimal
\nyang biasanya digunakan untuk lossless data compression. Huffman coding ditemukan oleh David A.
\nHuffman pada saat ia masih seorang mahasiswa di MIT, ia menerbitkan karyanya ditahun 1952 yang
\nberjudul “A Method for the Contruction of Minimum Redudancy Codes”. Adaptive Huffman Coding
\nadalah teknik pengkodean adaptif berdasarkan pengkodean Huffman. Adaptif mempunyai
\nimplementasi antara lain algoritma FGK dan algoritma Vitter. 
\nHasil dari studi banding mengenai tugas akhir ini adalah mengenai apa saja yang menjadi
\nkeunggulan Huffman coding dan Adaptive Huffman coding. 
\n
\nKata kunci : algoritma kompresi, tipe algoritma kompresi, Huffman Coding, Adaptive Huffman 
\nCoding

Cited by 0Open access

STUDI BANDING ALGORITMA KOMPRESI HUFFMAN CODING DAN ADAPTIVE HUFFMAN CODING

Metariana Aditya, Ds Mellia Liyanthy · 2017

ABSTRAK Algoritma kompresi menurut David Solomon (2007:2) adalah proses mengkonversikan sebuah input data stream (streamsumber, atau data mentah asli) menjadi data stream lainnya (bitstream hasil, atau stream yang telah terkompresi) yang berukuran lebih kecil. Berbagai tipe algoritma kompresi, antara lain: Huffman, LIFO, LZHUF, LZ77 dan variannya ( LZ78, LZW, GZIP), Dynamic Markov Compression (DMC), Block-SortingLossLess, Run-Length, Shannon-Fano, Arithmetic, PPM (Prediction by PartialMatching), Burrows-Wheeler, Block Sorting, dan Half Byte. Huffman Coding dan Adaptive Huffman Coding adalah salah satu tipe algoritma kompresi yang menjadi pokok bahasan dalam tugas akhir ini. Huffman Coding adalah sebuah tipe kode optimal yang biasanya digunakan untuk lossless data compression. Huffman coding ditemukan oleh David A. Huffman pada saat ia masih seorang mahasiswa di MIT, ia menerbitkan karyanya ditahun 1952 yang berjudul “A Method for the Contruction of Minimum Redudancy Codes”. Adaptive Huffman Coding adalah teknik pengkodean adaptif berdasarkan pengkodean Huffman. Adaptif mempunyai implementasi antara lain algoritma FGK dan algoritma Vitter. Hasil dari studi banding mengenai tugas akhir ini adalah mengenai apa saja yang menjadi keunggulan Huffman coding dan Adaptive Huffman coding. Kata kunci : algoritma kompresi, tipe algoritma kompresi, Huffman Coding, Adaptive Huffman Coding

Cited by 0

Modified JPEG huffman coding

G. Lakhani · IEEE Transactions on Image Processing · 2003

It is a well observed characteristic that when a DCT block is traversed in the zigzag order, the AC coefficients generally decrease in size and the run-length of zero coefficients increase in number. This article presents a minor modification to the Huffman coding of the JPEG baseline compression algorithm to exploit this redundancy. For this purpose, DCT blocks are divided into bands so that each band can be coded using a separate code table. Three implementations are presented, which all move the end-of-block marker up in the middle of DCT block and use it to indicate the band boundaries. Experimental results are presented to compare reduction in the code size obtained by our methods with the JPEG sequential-mode Huffman coding and arithmetic coding methods. The average code reduction to the total image code size of one of our methods is 4%. Our methods can also be used for progressive image transmission and hence, experimental results are also given to compare them with two-, three-, and four-band implementations of the JPEG spectral selection method.

Cited by 44

Quantum-inspired Huffman Coding

A. S. Tolba, M. Z. Rashad, M. A. El-Dosuky · arXiv (Cornell University) · 2013

Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol. The traditional Huffman coding has two procedures: constructing a tree in O(n^2) and then traversing it in O(n). Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics. Instantaneousness and variable length features are difficult to generalize to the quantum case. The quantum coding field is pioneered by Schumacher works on block coding scheme. To encode N signals sequentially, it requires O(N3) computational steps. The encoding and decoding processes are far from instantaneous. Moreover, the lengths of all the codewords are the same. A Huffman-coding-inspired scheme for the storage of quantum information takes O(N(log N)a) computational steps for a sequential implementation on non-parallel machines.

Cited by 0Open access

Is Huffman Coding Dead?

Bookstein And Klein, A. Bookstein I, T. Klein · 1993

In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is often negligible. Referring also to other criteria, we conclude that for many applications, Huffman codes should still remain a competitive choice.

Cited by 0