Results 11 to 20 of about 53,193 (208)
Enhance embedding capacity for switch map based multi-group EMD data hiding
Mathematical Biosciences and Engineering, 2019 Exploiting Modification Direction (EMD) based data hiding achieves good stego-image quality and high security level. Recently, a section-wise EMD was proposed to enhance the embedding capacity of EMD. Later, Wang et al.
Yan-Xiao Liu +2 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
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
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
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
علوم رایانش و فناوری اطلاعات, 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
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