Results 101 to 110 of about 1,801 (211)
Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes
, 2022 For a given independent and identically distributed (i.i.d.) source, Huffman code achieves the optimal average codeword length in the class of instantaneous code with a single code table. However, it is known that there exist time-variant encoders, which
Iwata, Ken-ichi, Hashimoto, Kengo
core
Quantum-inspired Huffman Coding
, 2020 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 ...
M Z Rashad, A S Tolba, M A El-Dosuky
core
The construction of binary Huffman equivalent codes with a greater number of synchronising codewords
, 2020 [[abstract]]An inherent problem with a Variable-Length Code (VLC) is that even a single bit error can cause a loss of synchronisation, and thus lead to error propagation.
黃育銘, Huang, YM
core +1 more source
A Two-phase Practical Parallel Algorithm for Construction of Huffman Codes
, 2008 - The construction of optimal prefix codes plays a significant and influential role in applications concerning information processing and communication. For decades, different algorithms were proposed treating the issue of Huffman codes construction and ...
Zeinab Zeinalpour Tabrizi +4 more
core
Kompresi Data Menggunakan Algoritme Huffman
, 2009 Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. Huffman algorithm is the most popular methods of text compression.
Adisantoso, Julio +2 more
core
Parallel Huffman Decoding (Extended Abstract)
, 2008 A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly in most cases.
Y. Wiseman, S. T. Klein
core
Sobre a redundância de grau ß de códigos binários [PDF]
, 1983 Dissertaçao (mestrado) - Universidade Federal de Santa Catarina, Centro de Ciências Físicas e Matemáticas, Programa de Pós-Graduação em Matemática, Florianópolis ...
Fiuza, Célia Jantsch
core
Constrained Optimal Querying: Huffman Coding and Beyond
, 2022 Huffman coding is well known to be useful in certain decision problems involving minimizing the average number of (freely chosen) queries to determine an unknown random variable.
Zhang, Shuyuan +2 more
core
The convex hull of Huffman codes
, 2010 Dans cette thèse, nous étudions l'enveloppe convexe des arbres binaires à racine sur n feuilles.Ce sont les arbres de Huffman dont les feuilles sont labellisées par n caractères.
Nguyen, Thanh Hai
core
Binary Huffman equivalent codes with a short synchronizing codeword
For a given set of codeword lengths, there are many different optimal variable-length codes, which are all Huffman equivalent codes, Some of these codes may contain a synchronizing codeword which resynchronizes the code whenever it is transmitted, The ...
core