Efficient implementation and empirical evaluation of compression by substring enumeration
S Kanai, H Yokoo, K Yamazaki… - IEICE Transactions on …, 2016 - search.ieice.org
S Kanai, H Yokoo, K Yamazaki, H Kaneyasu
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2016•search.ieice.orgThis paper gives an array-based practical encoder for the lossless data compression
algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use
of the relation between CSE and the Burrows-Wheeler transform. We also modify the
decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed
encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We
show compression results obtained when we perform experiments on such long data. The …
algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use
of the relation between CSE and the Burrows-Wheeler transform. We also modify the
decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed
encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We
show compression results obtained when we perform experiments on such long data. The …
This paper gives an array-based practical encoder for the lossless data compression algorithm known as Compression by Substring Enumeration (CSE). The encoder makes use of the relation between CSE and the Burrows-Wheeler transform. We also modify the decoding algorithm to accommodate to the proposed encoder. Thanks to the proposed encoder and decoder, we can apply CSE to long data of more than tens of megabytes. We show compression results obtained when we perform experiments on such long data. The results empirically validate theoretical predictions on CSE.
search.ieice.org
以上显示的是最相近的搜索结果。 查看全部搜索结果