High-performance BWT-based Encoders

Simple item page
dc.creatorTrinca, Dragos
dc.date2005-08-21
dc.date.accessioned2026-07-07T03:23:21Z
dc.date.available2026-07-07T03:23:21Z
dc.descriptionIn 1994, Burrows and Wheeler developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, MTF (move-to-front coding), and a version of the algorithms presented in [Dragos Trinca, ITCC-2004].
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/cs/0508086
dc.identifierhttp://arxiv.org/abs/cs/0508086
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32907
dc.subjectData Structures and Algorithms
dc.subjectE.4; F.4.3
dc.titleHigh-performance BWT-based Encoders
dc.typetext

Files

Collections

arXiv