DOI:
10.18413/2518-1092-2021-6-4-0-4
COMPRESSION OF ENCRYPTED AND HIDDEN DATA. FIXING THE AVERAGE TIME WHEN PERFORMING THE HUFFMAN CODING ALGORITHM
This paper presents an algorithm for compressing data that has been encrypted or hidden, as well as capturing performance – the average time it takes to encode and decode (compress / decompress) a lossless file up to 30%, using the Huffman coding algorithm.
Keywords: lossless data compression,
Huffman algorithm average time analysis,
Huffman coding,
data protection with data compression,
efficiency of lossless data compression.
Number of views: 929 (view statistics)
Количество скачиваний: 3412
Information for citation:
Kostikov V.A., Maslova M.A. Compression of encrypted and hidden data. Fixing the average time when performing the Huffman coding algorithm // Research result. Information technologies. – Т.6, №4, 2021. – P. 27-33. DOI: 10.18413/2518-1092-2021-6-4-0-4
While nobody left any comments to this publication.
You can be first.
The references will appear later