Results 101 to 110 of about 31,581 (252)
Probability updating-based adaptive hybrid coding
Tongxin xuebao, 2008 A probability updating mechanism was proposed for entropy coding. To achieve the best coding efficiency,probability updating based huffman code and structured code were jointly used,and the best context model was selected according as the correlation of ...
doaj +2 more sources
Competitive Advantage of Huffman and Shannon-Fano Codes [PDF]
, 2023 Spencer Congero, K. Zeger
openalex +1 more source
Maximal codeword lengths in Huffman codes [PDF]
The following question about Huffman coding, which is an important technique for compressing data from a discrete source, is considered. If p is the smallest source probability, how long, in terms of p, can the longest Huffman codeword be?
Abu-Mostafa, Y. S., Mceliece, R. J.
core +1 more source
Quantum-inspired Huffman Coding
, 2013 Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol.
Tolba, A. S. +2 more
openaire +2 more sources
RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
Радіоелектронні і комп'ютерні системи, 2016 Task of entropy group coding of data for reduce of its statistical redundancy on base of recursive group coding is considered. Recursive group coding provides effective coding of symbols of large alphabets.
Н. В. Кожемякина +1 more
doaj +1 more source
Joint Source-Channel Coding Using Variable-Length Error-Correcting Codes
Journal of Engineering and Sustainable Development, 2010 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
HUFFMAN CODING AS A NONLINEAR DYNAMICAL SYSTEM [PDF]
International Journal of Bifurcation and Chaos, 2011 In this paper, source coding or data compression is viewed as a measurement problem. Given a measurement device with fewer states than the observable of a stochastic source, how can one capture their essential information? We propose modeling stochastic sources as piecewise-linear discrete chaotic dynamical systems known as Generalized Luröth Series ...
openaire +2 more sources
Huffman Deep Compression of Edge Node Data for Reducing IoT Network Traffic
IEEE AccessData compression at the Internet of Things (IoT) edge node aims to minimize data traffic in smart cities. The traditional Huffman Coding Algorithm (HCA) is shown as the most effective compression algorithm for sensor data.
Ammar Said Nasif +4 more
doaj +1 more source
An Upper Limit of AC Huffman Code Length in JPEG Compression [PDF]
, 2009 Kenichi Horie
openalex +1 more source
Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes [PDF]
, 2022 Kengo Hashimoto, Iwata Ken-ichi
openalex +1 more source