Results 111 to 120 of about 2,854 (228)
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
Efficient pattern matching in compressed text via bit-parallel word-based encoding
Franklin OpenThis 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 +3 more
doaj +1 more source
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 +1 more source
(k, n) secret base64 data sharing scheme using simple modular arithmetic
Journal of King Saud University: Computer and Information SciencesA (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 +4 more
doaj +1 more source
Interview of Lilchy Huffman (1968)
, 2019 Interview of Lilchy Huffman. Topics discussed include dress code, visitation/dorms, food, communication.https://digitalcommons.bridgewater.edu/intergen_communications/1000/thumbnail ...
Hoffman, Sheyenne, Walling, Kalli
core +1 more source
AN APPLICATION OF PLANAR BINARY BITREES TO PREFIX AND HUFFMAN PREFIX CODE
, 2004 In this paper we construct prefix code in which the use of planar binary trees is replaced by the use of the planar binary bitrees. In addition, we apply the planar binary bitrees to the Huffman prefix code.
Zlatko Erjavec, Erjavec, Zlatko
core +1 more source
Conditional Word Count and Huffman Code Size are Two Sides of the Same Coin: Response to Koplenig
Conditional Word Count and Huffman Code Size are Two Sides of the Same Coin: Response to ...
Pedro Aceves, James Evans
core +1 more source
IMPLEMENTASI ALGORITMA HUFFMAN DALAM KOMPRESI DATA PADA DATABASE [PDF]
, 2018 Technological developments are getting faster and faster, resulting in a lot of digital data stored in a storage medium. Especially if the data is then stored in an unspecified time. So the amount of storage media needed to accommodate the data.
RIDWAN WULIDA SIAM, NIM. 14650024
core
ComputersLossless 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 +2 more
doaj +1 more source
Perbandingan Algoritma Huffman Code dan Algoritma Fibonacci Code Dalam Kompresi File Audio
, 2018 This research was conducted with the aim to analyze Huffman Code algorithm and Fibonacci Code algorithm in audio compression file with extension * .mp3.
Lubis, Muhammad Ridho Anggara
core