Filters








449 Hits in 3.5 sec

Burrows—Wheeler Compression [chapter]

Peter Fenwick
2003 Lossless Compression Handbook  
The material of this chapter, while quoting extensively from other work, is in part a summary of my own experience and thoughts in working with the Burrows-Wheeler compression algorithm.  ...  These methods are among the mathematically most complex used in a Burrows-Wheeler compressor, the results are the best known for a Burrows-Wheeler compressor.  ...  Statistical Coding Most of the work on high performance Burrows-Wheeler compressors has used arithmetic coders, or a complex of such coders, in the final stage.  ... 
doi:10.1016/b978-012620861-0/50008-5 fatcat:bmdaqour2fea3lqzco5k5im4ym

Lossless data compression with error correcting codes

G. Caire, S. Shamai, S. Verdu
2003 IEEE International Symposium on Information Theory, 2003. Proceedings.  
Data compression based on the Burrows-Wheeler transform: Analysis and optimality.  ...  The basic encoding scheme ( Figure 1 ) takes a fixed-length block of data and passes it through the Burrows-Wheeler (Block sorting) transform.  ...  The basic encoding scheme ( Figure 1 ) takes a fixed-length block of data and passes it through the Burrows-Wheeler (Block sorting) transform.  ... 
doi:10.1109/isit.2003.1228036 fatcat:aglyo2gnune4zclvgelmlmooey

Burrows–Wheeler compression: Principles and reflections

Peter Fenwick
2007 Theoretical Computer Science  
After a general description of the Burrows Wheeler Transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect  ...  The paper then proposes some new interpretations and uses of the Burrows Wheeler transform, with new insights and approaches to lossless compression, perhaps including techniques from error correction.  ...  A compressor using derived contexts In contrast to most previous Burrows Wheeler work, we concentrate on the reverse transform, breaking it open and incorporating much of the reverse transform into the  ... 
doi:10.1016/j.tcs.2007.07.012 fatcat:rsifq647zngobjgifvi22nddru

The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression [chapter]

Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
2006 Lecture Notes in Computer Science  
In particular, Move-to-Front Encoding is generally believed to be an "inefficient" part of the Burrows-Wheeler compression process.  ...  This is particularly true for Burrows and Wheeler Compression a technique that is important in itself and for the design of compressed indexes.  ...  This can be done even without any knowledge of the Burrows-Wheeler transform!  ... 
doi:10.1007/11841036_67 fatcat:7zmx6rdxufgylljqndumzg623e

25 Years of the Burrows-Wheeler Transform (Dagstuhl Seminar 19241)

Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Jens Stoye, Michael Wagner
2019 Dagstuhl Reports  
Dagstuhl Seminar 19241 ("25 Years of the Burrows-Wheeler Transform") took place from June 10th to 14th, 2019, and was attended by 45 people from 13 countries and the three fields of Algorithms and Data  ...  Feedback was generally positive and we are confident the seminar fostered interdisciplinary connections and will eventually result in noteworthy joint publications. License Creative Commons BY 3.0  ...  We present an index data structure for the bijective Burrows-Wheeler transform [1] . The index data structure is based on the FM index [2] .  ... 
doi:10.4230/dagrep.9.6.55 dblp:journals/dagstuhl-reports/GagieMNS19 fatcat:vw3nruzqkzbrdi3rpxpqtjkosa

Analysis of the Burrows-Wheeler Transform [chapter]

2008 The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching  
The Burrows-Wheeler Transform (also known as Block-Sorting) is at the base of compression algorithms which are the state of the art in lossless data compression.  ...  The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the Gzip compressor.  ...  INTRODUCTION A recent breakthrough in data compression has been the introduction of the Burrows-Wheeler Transform (BWT from now on) [Burrows and Wheeler 1994] .  ... 
doi:10.1007/978-0-387-78909-5_5 fatcat:jqbbg6rlebfwvjgolh3goqq3ia

An Efficient Data Compression Approach based on Entropic Codingfor Network Devices with Limited Resources

Elie Fute Tagne, Hugues Marie Kamdjou, Alain Bertrand Bomgni, Armand Nzeukou
2019 European Journal of Electrical Engineering and Computer Science  
The proposed approachis based on entropic Arithmetic coding, Run-length encoding, Burrows-wheeler transform and Move-to-front encoding.  ...  However, lossless compression techniques are almost unacceptable in the application fields where data does not allow alterations because of the fact that loss of crucial information can distort the analysis  ...  We precede this Burrows-Wheeler Transform-based transform coding, to increase the chances of having more consecutive characters or bits repeated.  ... 
doi:10.24018/ejece.2019.3.5.121 fatcat:v4e3fk7fwzhltdfvab4mrj272u

Boosting textual compression in optimal linear time

Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino
2005 Journal of the ACM  
Further, we settle analytically some long-standing open problems about the algorithmic structure and the performance of BWT-based compressors.  ...  The final compressed string is then obtained by compressing individually each substring of the partition by means of the base compressor we wish to boost.  ...  The authors are deeply indebted to the referees, and in particular one of them, for a very careful reading of the article that lead to very useful, punctual and constructive comments.  ... 
doi:10.1145/1082036.1082043 fatcat:ljhmm5ehanc4lnaoasuaykbasu

Conjugation-based compression for Hebrew texts

Yair Wiseman, Irit Gefner
2007 ACM Transactions on Asian Language Information Processing  
This article suggests a tool that optimizes the Burrows-Wheeler algorithm which is an unaware morphological rules compression method.  ...  This can be less critical in languages like English where most of the sequences are illegal according to the grammatical rules of the language, for example, zx, bv or qe; hence the morphology can add a  ...  We would like to focus in this article on the Burrows-Wheeler Algorithm [Burrows and Wheeler 1994; Nelson 1996] which is an adaptive method in most of its steps.  ... 
doi:10.1145/1227850.1227854 fatcat:nzzv5jftnjg5rbb4dxinzwmzbe

A simple storage scheme for strings achieving entropy bounds

Paolo Ferragina, Rossano Venturini
2007 Theoretical Computer Science  
We also apply our storage scheme to the Burrows-Wheeler Transform [M. Burrows, D.  ...  Venturini). 1 This is a lower bound to the space achieved by any k-th order compressor. 0304-3975/$ -see front matter c  ...  The Burrows-Wheeler transform In [2] Burrows and Wheeler introduced a new compression algorithm based on a reversible transformation now called the Burrows-Wheeler Transform (BWT).  ... 
doi:10.1016/j.tcs.2006.12.012 fatcat:luuftujah5cppfw7fpuhtsst2e

An analysis of the Burrows---Wheeler transform

Giovanni Manzini
2001 Journal of the ACM  
The Burrows-Wheeler Transform (also known as Block-Sorting) is at the base of compression algorithms which are the state of the art in lossless data compression.  ...  The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the Gzip compressor.  ...  INTRODUCTION A recent breakthrough in data compression has been the introduction of the Burrows-Wheeler Transform (BWT from now on) [Burrows and Wheeler 1994] .  ... 
doi:10.1145/382780.382782 fatcat:qgjjszcgmnajleiv66huj5axea

Page 1300 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the gzip compressor.  ...  Summary: “The Burrows-Wheeler transform (also known as block-sorting) is at the base of compression algorithms that are the state of the art in lossless data compression.  ... 

On Optimally Partitioning a Text to Improve Its Compression [chapter]

Paolo Ferragina, Igor Nitto, Rossano Venturini
2009 Lecture Notes in Computer Science  
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a base-compressor C gets a compressed output that is shorter than applying  ...  . 1 When T is a text string, the most famous instantiation of the PPC-paradigm has been obtained by combining the Burrows and Wheeler Transform [6] (shortly BWT) with a context-based grouping of the  ...  Fig. 1 Burrows-Wheeler Transform of the word mississippi.  ... 
doi:10.1007/978-3-642-04128-0_38 fatcat:nsl7gu5y6fh4boojrtiypnnddu

On Optimally Partitioning a Text to Improve Its Compression

Paolo Ferragina, Igor Nitto, Rossano Venturini
2010 Algorithmica  
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a base-compressor C gets a compressed output that is shorter than applying  ...  . 1 When T is a text string, the most famous instantiation of the PPC-paradigm has been obtained by combining the Burrows and Wheeler Transform [6] (shortly BWT) with a context-based grouping of the  ...  Fig. 1 Burrows-Wheeler Transform of the word mississippi.  ... 
doi:10.1007/s00453-010-9437-6 fatcat:4rmr2kxc4zct3b2trrl37pstpa

Optimally Partitioning a Text to Improve Its Compression [chapter]

Rossano Venturini
2013 Atlantis Studies in Computing  
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a base-compressor C gets a compressed output that is shorter than applying  ...  . 1 When T is a text string, the most famous instantiation of the PPC-paradigm has been obtained by combining the Burrows and Wheeler Transform [6] (shortly BWT) with a context-based grouping of the  ...  Fig. 1 Burrows-Wheeler Transform of the word mississippi.  ... 
doi:10.2991/978-94-6239-033-1_3 fatcat:oobkz6d7rfapjlh64t4kgsglyq
« Previous Showing results 1 — 15 out of 449 results