Results 31 to 40 of about 2,102 (184)

Comparative analysis of code execution time by C and Python based on selected algorithms

open access: yesJournal 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

Huffman Tree and Binary Conversion for Efficient and Secure Data Encryption and Decryption

open access: yesJournal of Cybersecurity and Privacy
This 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

Fast and efficient lossless encoder in image compression with low computation and low memory

open access: yesIET 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

open access: yesMathematics, 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

Enhancement of QR Code Capacity by Encrypted Lossless Compression Technology for Verification of Secure E-Document

open access: yesIEEE 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

A Simple and Efficient IQ Data Compression Method Based on Latency, EVM, and Compression Ratio Analysis

open access: yesIEEE 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

Creation of a video data reliability assessment model for compression coding technology in the conditions of errors in the data transmission channel

open access: yesСистеми обробки інформації, 2022
The technology of compression coding of video data for information communication systems of the air segment is being studied. Distinctive features of the developed technology are the following: structural decomposition of the information space by ...
С. І. Хмелевський   +5 more
doaj   +1 more source

Message Group Optimization in Kyber-512 Post-Quantum Cryptography: Comparing Proposed Static Encoding With Huffman Code, Base-64, and ASCII Methods

open access: yesIEEE Access
Post-Quantum Cryptography (PQC) indicates a significant progression in cryptographic research. Kyber-512, a principal algorithm in the Kyber family, has attained international standard certification in PQC.
Kritsanapong Somsuk
doaj   +1 more source

Teknik Kompresi pada Transmisi Data Citra Payload KOMURINDO

open access: yesKomputika, 2018
Dalam bidang teknologi informasi, citra merupakan elemen penting dalam penyediaan informasi visual. Pada kompetisi KOMURINDO, pengiriman data gambar dan data sensor merupakan penilaian wajib.
Muhammad Aria, Aang Sanjaya
doaj   +1 more source

Space-efficient Huffman codes revisited

open access: yesInformation 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. It uses $σ\lg \ell_{\text{max}} + o(σ) + O(\ell_{\text{
Szymon Grabowski, Dominik Köppl
openaire   +3 more sources

Home - About - Disclaimer - Privacy