Word-based text compression using the Burrows-Wheeler transform

DOI10.1016/J.IPM.2004.08.009MaRDI QIDQ2485032zbMATH OpenOpenAlexFDO

Authors Alistair Moffat, R. Yugo Kartono Isal

Publication date 3 August 2005

Published in Information Processing and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipm.2004.08.009

zbMATH Keywords

Burrows-Wheeler transformationText compressionMove-to-FrontRecency rankingWord-based model

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1305460
• An analysis of the Burrows-Wheeler transform
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• Burrows-Wheeler compression: Principles and reflections
• Investigation of block-sorting of multiset permutations

Cited in

(7)

• Burrows-Wheeler compression: Principles and reflections
• On undetected redundancy in the Burrows-Wheeler transform
• Compression algorithm of text files based on LZSS
• Can Burrows-Wheeler transform be replaced in chain code compression?
• Investigation of block-sorting of multiset permutations
• On optimally partitioning a text to improve its compression
• An algorithm using Walsh transformation for compressing typeset documents

This page was built for publication: Word-based text compression using the Burrows-Wheeler transform

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