837 search results - page 5 / 168 » Dynamic Burrows-Wheeler Transform |
CCP
2011
12 years 7 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
CPM
2008
Springer
13 years 9 months ago
2008
Springer
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— Given an AWGN channel, we look at the problem of designing a source controlled binary antipodal signaling system for transmitting blocks of binary symbols generated either by a...
DCC
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
IJFCS
2006
13 years 7 months ago
2006
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...