Results 1 to 10 of about 130 (123)
IET Communications, 2011 In this study, the authors consider the class of anti-uniform Huffman (AUH) codes. The authors derived tight lower and upper bounds on the average codeword length, entropy and redundancy of finite and infinite AUH codes in terms of the alphabet size of the source. These bounds are tighter than similar bounds.
Mohajer, S., Kakhbod, A.
exaly +3 more sources
Efficient Coding of the Embedded Signal in Steganographic Systems with Multiple Access [PDF]
Problems of the Regional Energetics, 2021 Today, steganographic systems with multiple access are of considerable importance. In such sys-tems, the orthogonal Walsh-Hadamard transform is most often used for multiplexing and divid-ing channels, which leads to the need for efficient coding of the ...
Kobozeva A.A., Kobozeva A.A.,
doaj +1 more source
Generalization of Fibonacci Codes to the Non-Binary Case
IEEE Access, 2022 Motivated by expected technological developments in which the basic unit of storage might possibly be $d$ -ary elements, with $d > 2$ , and not just bits, we extend the traditional Fibonacci code to non-binary codes of higher order, and prove their ...
Shmuel T. Klein +2 more
doaj +1 more source
An Improved Image Compression Algorithm Using 2D DWT and PCA with Canonical Huffman Encoding
Entropy, 2023 Of late, image compression has become crucial due to the rising need for faster encoding and decoding. To achieve this objective, the present study proposes the use of canonical Huffman coding (CHC) as an entropy coder, which entails a lower decoding ...
Rajiv Ranjan, Prabhat Kumar
doaj +1 more source
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 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
International journal of health sciences, 2022 In the proposed Huffman LEACH model, energy consumption increases exponentially with distance and there are no maximum limits. The transmit power level of a sensor node can only be adjusted to discrete values that may result in one transmit power level for various distances.
Sunil S. Harakannanavar +5 more
openaire +1 more source
Computers & Mathematics with Applications, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdul Mannan, M., Kaykobad, M.
openaire +2 more sources
Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation
Algorithms, 2019 Non-uniquely-decodable (non-UD) codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non–prefix–free codes, where a code-word can be a prefix of other(s)
Muhammed Oğuzhan Külekci +1 more
doaj +1 more source
علوم رایانش و فناوری اطلاعات, 2021 All binary codes, even Huffman optimal code, are kind of non-optimal bit arrangement. Therefore, binary code optimization is a challenging problem. In this paper an algorithm is proposed to optimize the codes by converting any type of binary code to a ...
پرویز قره باقری +2 more
doaj
Low-Power Lossless Data Compression for Wireless Brain Electrophysiology
Sensors, 2022 Wireless electrophysiology opens important possibilities for neuroscience, especially for recording brain activity in more natural contexts, where exploration and interaction are not restricted by the usual tethered devices.
Aarón Cuevas-López +4 more
doaj +1 more source