Inversion coding
Inversion coding
复制标题
DOI：
10.1093/comjnl/47.1.46
复制
发表时间：
2004-01-01
期刊：
影响因子：
1.4
通讯作者：
Arnavut, Z
中科院分区：
文献类型：
--
作者：
Arnavut, Z
Burrows和惠勒提出的Burrows-惠勒压缩（BWC）模型受到了广泛的关注。《生物武器公约》方案的一个基本部分是移到前面编码器（新近排序）。在本文中，我们介绍了一种不同的编码（排名）计划，逆编码器。证明了区间秩与规范排序置换之间的信息论关系。我们还介绍了一个更快，更节省内存的算法的逆序。最后，我们探讨了反转排序和近因排序之间的关系，并表明反转编码上级区间排序以及近因排序。
The Burrows-Wheeler Compression (BWC) described by Burrows and Wheeler has received considerable attention. An essential part of BWC schemes is the Move-to-Front coder (recency ranking). In this paper we introduce a different coding (ranking) scheme, the inversion coder. We prove the information theoretic relationship between interval ranks and canonical sorting permutations. We also introduce a faster and more memory efficient-algorithm for inversion ranks. Finally, we explore the relationship between inversion ranks and recency ranks and show that inversion coding is superior to interval ranking as well as recency ranking.