Results 1 to 10 of about 51,470 (129)
An efficient chain code with Huffman coding
This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes differ importantly. Therefore, the Huffman coding was applied.
Borut Zalik
exaly +3 more sources
On the application of wavelet transform and Huffman algorithm to Yorùbá language syntax text files compression [PDF]
Most algorithms of data compression were developed with English language as target text syntax. However, this paper approaches the problem of Yorùbá text files compression via the use of Discrete Wavelet Transform (DWT) and Huffman algorithm ...
Amusa Kamoli Akinwale +4 more
doaj +1 more source
A lossless compression method for logging data while drilling
Mud pulse transmission technology is widely used in logging while drilling (LWD), while its low data transmission efficiency has restricted the development of LWD technology for a long time. In order to improve the equivalent data transmission efficiency
Shan Song +5 more
doaj +1 more source
Compression of speech using a hybrid method [PDF]
Voice compression is one of the important subject today specially in field of communication and application so in this paper, speech compression was adopted based on hybrid technique between wavelet and Huffman code.
Israa Abdlqader
doaj +1 more source
Biosignal Compression Toolbox for Digital Biomarker Discovery
A critical challenge to using longitudinal wearable sensor biosignal data for healthcare applications and digital biomarker development is the exacerbation of the healthcare “data deluge,” leading to new data storage and organization challenges and costs.
Brinnae Bent +3 more
doaj +1 more source
A Decentralized Medical Network for Maintaining Patient Records Using Blockchain Technology
Personal Medical Records (PMR) manage an individual’s medical information in digital form and allow patients to view their medical information and doctors to diagnose diseases. Today’s institution-dependent centralized storage, fails to give trustworthy,
Sumathi M. +3 more
doaj +1 more source
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding [PDF]
Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's precept, these problems are tackled by complex analysis methods such as generating functions,
Wojciech Szpankowski
doaj +1 more source
Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite Sources [PDF]
By definition Huffman codes only exist for finite sources, since the Huffman algorithm cannot be applied to an infinite source. On the other hand, Gallager's sibling property, which was introduced as a characterization of Huffman codes, extends naturally
Klimesh, Matthew, McEliece, Robert J.
core +1 more source
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known.
Ian Blanes +3 more
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

