Results 101 to 110 of about 2,705,238 (250)

Is every compact code Huffman?

Discrete Mathematics, 1992
The author shows that not every compact code is Huffman, but there is an equivalence relation between codes upto which all compact codes are Huffman.
openaire   +1 more source

Image Watermarking based on Huffman Coding and Laplace Sharpening

مجلة كلية التربية للبنات, 2019
In this paper, an algorithm through which we can embed more data than the regular methods under spatial domain is introduced. We compressed the secret data using Huffman coding and then this compressed data is embedded using laplacian sharpening method ...
Muna M. Lafta
doaj  

Tradeoff Between Speed and Memory Requirements for Decoding of Prefix-Free Codes

Algorithms
For the decoding of prefix-free codes such as Huffman code, we present a tradeoff between the decoding speed and memory requirements that results in an adapted decoding algorithm.
Jörg Keller, Christina Kahle
doaj   +1 more source

Huffman source coding

, 2021
Abstract. 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.
openaire   +1 more source

(k, n) secret base64 data sharing scheme using simple modular arithmetic

Journal of King Saud University: Computer and Information Sciences
A (k, n) secret sharing (SS) is a threshold scheme that shares secret multimedia data into n sub-secrets (called shares). When any k or more shares are collected, the secret is recovered.
Ching-Nung Yang, Shengyi Cao, Yu-Sheng Li, Lingchen Gu, Wenbo Wan   +4 more
doaj   +1 more source

Efficient pattern matching in compressed text via bit-parallel word-based encoding

Franklin Open
This paper introduces an optimized algorithm designed to accelerate compressed word matching using advanced bit-parallelism techniques, resulting in a high-performance solution. The proposed algorithm (BIT_COMP) uses the concept of word-based tagged code
Rajesh Prasad, Santosh Kumar Upadhyay, Vikas, Surya Prakash Mishra   +3 more
doaj   +1 more source

Lossless Compression of Malaria-Infected Erythrocyte Images Using Vision Transformer and Deep Autoencoders

Computers
Lossless compression of medical images allows for rapid image data exchange and faithful recovery of the compressed data for medical image assessment. There are many useful telemedicine applications, for example in diagnosing conditions such as malaria ...
Md Firoz Mahmud, Zerin Nusrat, W. David Pan   +2 more
doaj   +1 more source

Empirical and Statistical Evaluation of the Effectiveness of Four Lossless Data Compression Algorithms

Nigerian Journal of Technological Development, 2016
Data compression is the process of reducing the size of a file to effectively reduce storage space and communication cost. The evolvement in technology and digital age has led to an unparalleled usage of digital files in this current decade.
N. A. Azeez, A. A. Lasisi
doaj  

Image Steganography using LSB and LSB+Huffman Code

, 2014
W. I. A. Al-mazaydeh
semanticscholar   +1 more source

Data compression using static Huffman code-decode tables

CACM, 1985
D. R. McIntyre, M. Pechura
semanticscholar   +1 more source