Results 11 to 20 of about 2,705,238 (250)
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
Prefix Codes: Equiprobable Words, Unequal Letter Costs [PDF]
, 1996 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
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
IEEE Access, 2019 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
A Dynamic and Parallel Two-Stage Lossless Data Compression Method for Smart Grid
IEEE Access, 2023 With the rapid development of smart grid (SG) technologies, massive system data has been generated for SG for grid operation status monitoring and fault warning, this massive integrated data has brought great challenges for data transmission and storage.
Yanxia Wu +5 more
doaj +1 more source
Space-efficient Huffman codes revisited
Information Processing Letters, 2023 Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encode or decode a symbol in constant worst case time.
Szymon Grabowski, Dominik Köppl
openaire +3 more sources
The Optimal Fix-Free Code for Anti-Uniform Sources
Entropy, 2015 An \(n\) symbol source which has a Huffman code with codelength vector \(L_{n}=(1,2,3,\cdots,n-2,n-1,n-1)\) is called an anti-uniform source. In this paper, it is shown that for this class of sources, the optimal fix-free code and symmetric fix-free ...
Ali Zaghian +2 more
doaj +1 more source
Energy Efficient Transmission over Space Shift Keying Modulated MIMO Channels [PDF]
, 2012 Energy-efficient communication using a class of spatial modulation (SM) that encodes the source information entirely in the antenna indices is considered in this paper. The energy-efficient modulation design is formulated as a convex optimization problem,
Chang, Ronald Y. +2 more
core +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
Penerapan Metode Kompresi Huffman untuk Meningkatkan Jumlah Data Informasi pada Kode Quick Response
JOINS (Journal of Information System), 2022 Kecepatan memperoleh informasi merupakan hal yang sangat penting. Pemanfaatan kode Quick Response (QR) menjadi salah satu cara dalam upaya memperoleh informasi secara cepat.
Hidayat Hidayat +1 more
doaj +1 more source
Aplikasi Graf Pohon Pada Algoritma Huffman [PDF]
, 2011 : Binary number system is more used in computer technology. Binary number used by the Huffman algorithm on the tree in graph teory. Huffman algorithm using the principle similar to Morse code, ie each character isencoded only by a series of multiple bits
Amrullah, A. (Amrullah)
core +2 more sources