DEVELOPMENT OF A DATA COMPRESSION ALGORITHM BASED ON THE HUFFMAN METHOD
Rubrics: ARTICLES
Authors:
1.
Emperor Alexander I St. Petersburg State Transport University
2.
Emperor Alexander I St. Petersburg State Transport University
3.
Emperor Alexander I St. Petersburg State Transport University
Type:
Article
Pages:
from 42
to 46
Status:
Published
Received:
11.01.2025
Accepted:
11.01.2025
Published:
11.01.2025
Subject area:
UDK УДК
Language:
Russian
Keywords:
lossless compression, lossy compression, compression algorithms, coding, code tree
Abstract (English):
The article is devoted to the development of an algorithm for compressing data of various types, represented as files in the external memory of a computer, based on the Huffman method. The Huffman algorithm of minimal prefix coding is considered in detail. The purpose of writing this paper is to study and compare various data compression algorithms, as well as the practical application of the algorithm based on the Huffman method for writing a file compressor program.
The article is devoted to the development of an algorithm for compressing data of various types, represented as files in the external memory of a computer, based on the Huffman method. The Huffman algorithm of minimal prefix coding is considered in detail. The purpose of writing this paper is to study and compare various data compression algorithms, as well as the practical application of the algorithm based on the Huffman method for writing a file compressor program.
Keywords:
lossless compression, lossy compression, compression algorithms, coding, code tree
lossless compression, lossy compression, compression algorithms, coding, code tree
1.
