Results 21 to 30 of about 2,705,238 (250)
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
Huffman Coding with Non-sorted Frequencies [PDF]
Data Compression Conference (dcc 2008), 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klein, Shmuel T., Shapira, Dana
openaire +1 more source
Comparative analysis of code execution time by C and Python based on selected algorithms
Journal of Computer Sciences Institute, 2023 The article deals with a comparative analysis of the speed of code execution written in the C language and Python. In order to determine whether a scripting language can match the performance of a compiled language, a comparison of the languages was ...
Paweł Rysak
doaj +1 more source
Enhanced Huffman Coded OFDM with \\Index Modulation [PDF]
IEEE Transactions on Wireless Communications, 2020 <pre>In this paper, we propose an enhanced Huffman coded orthogonal frequency-division multiplexing with index modulation (EHC-OFDM-IM) scheme. The proposed scheme is capable of utilizing all legitimate subcarrier activation patterns (SAPs) and adapting the bijective mapping relation between SAPs and leaves on a given Huffman tree according to ...
Shuping Dang +4 more
openaire +4 more sources
IEEE Access, 2020 This paper provides a novel method to improve the data storage of a quick response code (QR code) by applying encrypted lossless compression technology. QR codes are used in several domains, particularly when there is a need to transfer various types of ...
Ammar Mohammed Ali, Alaa Kadhim Farhan
doaj +1 more source
Fast and efficient lossless encoder in image compression with low computation and low memory
IET Image Processing, 2021 This research focuses on frequency‐based lossless new encoding technique with low computation and low memory scheme. This encoding technique doesn't require, any table similar to Huffman and Golomb Rice encoder, and doesn't take high computation time ...
N. Karthikeyan +2 more
doaj +1 more source
Using Probabilistic Models for Data Compression
Mathematics, 2022 Our research objective is to improve the Huffman coding efficiency by adjusting the data using a Poisson distribution, which avoids the undefined entropies too. The scientific value added by our paper consists in the fact of minimizing the average length
Iuliana Iatan +3 more
doaj +1 more source
Huffman Tree and Binary Conversion for Efficient and Secure Data Encryption and Decryption
Journal of Cybersecurity and PrivacyThis study proposes the Huffman Tree and Binary Conversion (HTB) which is a preprocessing algorithm to transform the Huffman tree into binary representation before the encryption process.
Suchart Khummanee +4 more
doaj +1 more source
First-Come-First-Served for Online Slot Allocation and Huffman Coding [PDF]
, 2013 Can one choose a good Huffman code on the fly, without knowing the underlying distribution? Online Slot Allocation (OSA) models this and similar problems: There are n slots, each with a known cost. There are n items.
Khare, Monik +2 more
core +2 more sources
IEEE Access, 2019 Latency, error vector magnitude (EVM) and compression ratio (CR) are performance evaluation factors of IQ data compression. The purposes of IQ data compression are to minimize the latency, EVM and to maximize the CR.
Jewon Lee, Eunhee Hyun, Joon-Young Jung
doaj +1 more source