Results 21 to 30 of about 31,581 (252)
A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming
Computers, 2021 There is always an increasing demand for data storage and transfer; therefore, data compression will always be a fundamental need. In this article, we propose a lossless data compression method focused on a particular kind of data, namely, chat messages,
Julián Moreno Cadavid +1 more
doaj +1 more source
A quantum analog of Huffman coding [PDF]
, 1998 We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication.
Braunstein, Samuel L. +3 more
core +3 more sources
Space-efficient Huffman codes revisited
Information Processing Letters, 2023 Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encode or decode a symbol in constant worst case time.
Szymon Grabowski, Dominik Köppl
openaire +3 more sources
Lossless text compression using GPT-2 language model and Huffman coding [PDF]
SHS Web of Conferences, 2021 Modern daily life activities produced lots of information for the advancement of telecommunication. It is a challenging issue to store them on a digital device or transmit it over the Internet, leading to the necessity for data compression.
Rahman Md. Atiqur, Hamada Mohamed
doaj +1 more source
Prefix Codes: Equiprobable Words, Unequal Letter Costs [PDF]
, 1996 Describes a near-linear-time algorithm for a variant of Huffman coding, in which the letters may have non-uniform lengths (as in Morse code), but with the restriction that each word to be encoded has equal probability.
Knuth Donald E. +2 more
core +6 more sources
Advances in Electrical and Computer Engineering, 2013 This paper proposes a novel model of the two-level scalar quantizer with extended Huffman coding. It is designed for the average bit rate to approach the source entropy as close as possible provided that the signal to quantization noise ratio (SQNR ...
PERIC, Z. +4 more
doaj +1 more source
An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression
Applied Sciences, 2019 Huffman encoding and arithmetic coding algorithms have shown great potential in the field of image compression. These algorithms are the origin of current image compression techniques. Nevertheless, there are some deficiencies in both algorithms that use
Erdal Erdal, Atilla Ergüzen
doaj +1 more source
Huffman Coding with Non-sorted Frequencies [PDF]
Data Compression Conference (dcc 2008), 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klein, Shmuel T., Shapira, Dana
openaire +1 more source
Comparison of Effects of Entropy Coding Schemes Cascaded with Set Partitioning in Hierarchical Trees
Mehran University Research Journal of Engineering and Technology, 2018 WT (Wavelet Transform) is considered as landmark for image compression because it represents a signal in terms of functions which are localized both in frequency and time domain.
Ali Iqbal +4 more
doaj +1 more source
Enhanced Huffman Coded OFDM with \\Index Modulation [PDF]
IEEE Transactions on Wireless Communications, 2020 <pre>In this paper, we propose an enhanced Huffman coded orthogonal frequency-division multiplexing with index modulation (EHC-OFDM-IM) scheme. The proposed scheme is capable of utilizing all legitimate subcarrier activation patterns (SAPs) and adapting the bijective mapping relation between SAPs and leaves on a given Huffman tree according to ...
Shuping Dang +4 more
openaire +4 more sources