We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transfor...
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a loss...
Abstract—In this paper, an asymmetric Slepian-Wolf coding (SWC) scheme for binary finite memory source (FMS) is proposed. The a priori information about the source is extracted ...
Chao Chen, Xiangyang Ji, Qionghai Dai, Xiaodong Li...