Results 11 to 20 of about 30,630 (205)
Lossless Text Image Compression using Two Dimensional Run Length Encoding
Text images are used in many types of conventional data communication where texts are not directly represented by digital character such as ASCII but represented by an image, for instance facsimile file or scanned documents.
Hilal H Nuha
doaj +1 more source
Lossless Compression Algorithm Based on Hybrid Coding of Adaptive Huffman and Golomb-Rice for WSN [PDF]
Aiming at the problem that traditional Wireless Sensor Network(WSN) data compression algorithms cannot take both compression efficiency and data loss into account,a fast and efficient Lossless Adaptive Compression(LAC) algorithm based on adaptive Huffman
XIE Ruiyun,HAI Benzhai
doaj +1 more source
A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming
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
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdul Mannan, M., Kaykobad, M.
openaire +2 more sources
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.
Sunil S. Harakannanavar +5 more
openaire +1 more source
Lossless text compression using GPT-2 language model and Huffman coding [PDF]
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
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
Approximating Huffman Codes in Parallel
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Berman +2 more
openaire +3 more sources
An Efficient Encoding Algorithm Using Local Path on Huffman Encoding Algorithm for Compression
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
Prefix Codes: Equiprobable Words, Unequal Letter Costs [PDF]
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

