Compression of information objects using combinatorial generation methods based on AND/OR trees
DOI: 10.21293/1818-0442-2024-27-4-74-79
DOI: 10.21293/1818-0442-2024-27-4-74-79
Abstract: This article discusses the problem of lossless data compression using combinatorial generation methods based on AND/OR trees. It presents a scheme for encoding information objects that are complex discrete structures with bijective mapping onto AND/OR trees. In addition, the features of the encoding pro-cess implementation are demonstrated using the following structures as an example: texts, information system event logs, relational databases, and raster images.
Keywords: combinatorial generation, AND/OR tree, encoding, lossless data compression, bijection
Funding: The work was carried out with financial support from the Russian Science Foundation as part of scientific project No. 22-71-10052.
For citation:
Shablya Yu. V. Compression of information objects using combinatorial generation methods based on AND/OR trees. Doklady Tomskogo gosudarstvennogo universiteta sistem upravleniya i radioelektroniki, 2024, vol. 27, no. 4, pp. 74–79. DOI: 10.21293/1818-0442-2024-27-4-74-79
Authors and copyright holders:
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 701-582
Viktor N. Maslennikov
Executive Secretary of the Editor’s Office
Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia
Phone / Fax: + 7 (3822) 51-21-21 / 51-43-02