Can Burrows-Wheeler transform be replaced in chain code compression?

DOI10.1016/J.INS.2020.03.073MaRDI QIDQ2663576zbMATH OpenOpenAlexFDO

Authors Borut Žalik, Domen Mongus, Niko Lukač, Krista Rizman Ž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

zbMATH Keywords

Burrows-Wheeler transformchain codeslossless compressionmove-to-front transformprediction

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Burrows-Wheeler compression: Principles and reflections
• An analysis of the Burrows-Wheeler transform
• Investigation of block-sorting of multiset permutations
• Word-based text compression using the Burrows-Wheeler transform
• Transforming the Natural Language Text for Improving Compression Performance

Cites work

• A locally adaptive data compression scheme
• Amortized Computational Complexity
• An analysis of the Burrows-Wheeler transform
• An efficient raster font compression for embedded systems
• Arbitrarily Shaped Motion Prediction for Depth Video Compression Using Arithmetic Edge Coding
• Compressed vertex chain codes
• Computational models of rhythm and meter
• Computing the Burrows-Wheeler transform in place and in small space
• Data compression by means of a ``book stack
• Efficiency of chain codes to represent binary objects
• Efficient chain code compression with interpolative coding
• Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
• Efficient randomized pattern-matching algorithms
• Elements of Information Theory
• Handbook of data compression. With contributions by David Bryant
• Linear work suffix array construction
• Lossless compression of map contours by context tree modeling of chain codes
• Online algorithms. The state of the art
• Scalable Parallel Suffix Array Construction
• Two Efficient Algorithms for Linear Time Suffix Array Construction
• Two results on the list update problem

Cited in

(1)

• A new algorithm for compression of partially commutative alphabets

Describes a project that uses

Uses Software

• deBWT

This page was built for publication: Can Burrows-Wheeler transform be replaced in chain code compression?

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