Results 81 to 90 of about 2,102 (184)
Joint Source-Channel Coding Using Variable-Length Error-Correcting Codes
This paper explores the performance of both source coding and error-correction in a single coding step. Such joint source-channel coding is done here using codewords of varying lengths that have particular distance properties with each other, which ...
Maher K. M. AlAzawi, Suha Kassim Hadi
doaj
Efficient pattern matching in compressed text via bit-parallel word-based encoding
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 +3 more
doaj +1 more source
Image Watermarking based on Huffman Coding and Laplace Sharpening
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
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
(k, n) secret base64 data sharing scheme using simple modular arithmetic
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 +4 more
doaj +1 more source
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 +2 more
doaj +1 more source
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
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
A Sea Anemone Tentacle-Inspired Capacitive 3D Force Flexible Tactile Sensor for Human-Machine Interaction and Encoding Communication Applications. [PDF]
Wang X +8 more
europepmc +1 more source
High performance IP lookup through GPU acceleration to support scalable and efficient routing in data driven communication networks. [PDF]
Sonai V +4 more
europepmc +1 more source

