Results 21 to 30 of about 2,484,228 (241)
Lossless Text Image Compression using Two Dimensional Run Length Encoding
JOIN: Jurnal Online Informatika, 2020 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
Reversible Data Hiding in Encrypted Images Based on Multi-MSB Prediction and Huffman Coding [PDF]
IEEE transactions on multimedia, 2018 With the development of cloud storage and privacy protection, reversible data hiding in encrypted images (RDHEI) has attracted increasing attention as a technology that can: embed additional data in the image encryption domain, ensure that the embedded ...
Z. Yin, Youzhi Xiang, Xinpeng Zhang
semanticscholar +1 more source
Lossless Compression Algorithm Based on Hybrid Coding of Adaptive Huffman and Golomb-Rice for WSN [PDF]
Jisuanji gongcheng, 2016 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
Computers & Mathematics with Applications, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdul Mannan, M., Kaykobad, M.
openaire +2 more sources
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.
Sunil S. Harakannanavar +5 more
openaire +1 more source
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
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