Can Burrows-Wheeler transform be replaced in chain code compression?
From MaRDI portal
Publication:2663576
DOI10.1016/j.ins.2020.03.073zbMath1458.68067OpenAlexW3013277647MaRDI QIDQ2663576
Domen Mongus, Krista Rizman Žalik, Niko Lukač, Borut Žalik
Publication date: 19 April 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.03.073
Related Items (1)
Uses Software
Cites Work
- An efficient raster font compression for embedded systems
- Lossless compression of map contours by context tree modeling of chain codes
- Efficiency of chain codes to represent binary objects
- Online algorithms. The state of the art
- Data compression by means of a ``book stack
- Two results on the list update problem
- Efficient chain code compression with interpolative coding
- Computing the Burrows-Wheeler transform in place and in small space
- Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
- Compressed vertex chain codes
- Computational Models of Rhythm and Meter
- An analysis of the Burrows—Wheeler transform
- Linear work suffix array construction
- Handbook of Data Compression
- Amortized Computational Complexity
- A locally adaptive data compression scheme
- Efficient randomized pattern-matching algorithms
- Arbitrarily Shaped Motion Prediction for Depth Video Compression Using Arithmetic Edge Coding
- Scalable Parallel Suffix Array Construction
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- Elements of Information Theory
This page was built for publication: Can Burrows-Wheeler transform be replaced in chain code compression?
