Compression of information objects using combinatorial generation methods based on AND/OR trees

Download article in PDF format

Authors: Shablya Yu. V.

Annotation: 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: bijection, lossless data compression, encoding, and/or tree, combinatorial generation

Editorial office address

Executive Secretary of the Editor’s Office

 Editor’s Office: 40 Lenina Prospect, Tomsk, 634050, Russia

  Phone / Fax: + 7 (3822) 701-582

  journal@tusur.ru

 

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

Subscription for updates