Towards clean reversible lossless compression. A reversible programming experiment with zip

DOI10.1007/978-3-031-62076-8_7MaRDI QIDQ6637591zbMATH OpenFDO

Authors Therese Lyngby, Rasmus Ross Nylandsted, Robert Glück, Tetsuo Yokoyama

Publication date 13 November 2024

zbMATH Keywords

Burrows-Wheeler transforms (BWT)clean reversible algorithmsLempel-Ziv-Welch compression (LZW)lossless compression algorithmsreversible software

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites work

• scientific article; zbMATH DE number 7806139 (Why is no real title available?)
• A universal algorithm for sequential data compression
• FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
• Optimizing reversible simulation of injective functions
• Programming techniques for reversible comparison sorts
• Reversible computing from a programming language perspective
• Reversible space equals deterministic space
• Time/Space Trade-Offs for Reversible Computation

This page was built for publication: Towards clean reversible lossless compression. A reversible programming experiment with zip

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637591)