#### DMCA

## Asymptotic redundancy of the MTF scheme for stationary ergodic sources (2005)

Venue: | IEEE Trans. Inf. Theory |

Citations: | 1 - 0 self |

### Citations

12231 | Elements of Information Theory, - Cover, Thomas - 1991 |

1498 | A universal algorithm for sequential data compression,” - Ziv, Lempel - 1977 |

1330 | Information Theory: Coding Theorems for Discrete Memoryless Systems. - Csiszár, Körner - 1982 |

794 | Blocksorting lossless data compression algorithm”, SRC Research report 124, Digital Systems Research Center,
- Burrows, Wheeler
- 1994
(Show Context)
Citation Context ... is equivalent to the Recency–Rank scheme [2] and the Book–Stack scheme [3]. The MTF scheme is often used in several efficient data-compression methods. For instance, in the block-sorting (BS) method =-=[6]-=-, the MTF scheme with the Burrows–Wheeler transform attains very high compression performance for many practical files [6]. In the MTF scheme, each symbol of a data sequence is transformed to a positi... |

44 | Universal lossless source coding with the Burrows Wheeler transform.
- Effros, Viswesvariah, et al.
- 2002
(Show Context)
Citation Context ...istributed (i.i.d.) source in [5]. In these analyses, the symbol extension is introduced to show the asymptotic optimality, or source is assumed to be i.i.d. In the analyses of the BS method [4], [7]–=-=[9]-=-, the symbol extension is also used, because it is difficult to evaluate the performance of the MTF transform used in the BS method without the symbol extension. However, the symbol extension is not u... |

43 | Interval and recency Rank source coding: two on-line adaptive variable-length schemes
- Elias
(Show Context)
Citation Context ...kov sources, move-to-front (MTF) scheme, stationary ergodic sources. I. INTRODUCTION THE move-to-front (MTF) scheme [1] is a data-compression algorithm, which is equivalent to the Recency–Rank scheme =-=[2]-=- and the Book–Stack scheme [3]. The MTF scheme is often used in several efficient data-compression methods. For instance, in the block-sorting (BS) method [6], the MTF scheme with the Burrows–Wheeler ... |

37 |
An Exact formula for the move-to-front rule for self-organizing lisis
- Fill
- 1996
(Show Context)
Citation Context ... Digital Object Identifier 10.1109/TIT.2005.856941 large. Furthermore, the strict symbol-wise probability distribution of is studied for any independent and identically distributed (i.i.d.) source in =-=[5]-=-. In these analyses, the symbol extension is introduced to show the asymptotic optimality, or source is assumed to be i.i.d. In the analyses of the BS method [4], [7]–[9], the symbol extension is also... |

21 | of individual sequences via variable-rate coding,” Information Theory - “Compression - 1978 |

13 |
A locally adaptive compression scheme
- BENTLEY, SLEATOR, et al.
- 1986
(Show Context)
Citation Context ... source generally. Index Terms—Asymptotic redundancy, doubly stochastic process, Markov sources, move-to-front (MTF) scheme, stationary ergodic sources. I. INTRODUCTION THE move-to-front (MTF) scheme =-=[1]-=- is a data-compression algorithm, which is equivalent to the Recency–Rank scheme [2] and the Book–Stack scheme [3]. The MTF scheme is often used in several efficient data-compression methods. For inst... |

8 |
The asymptotic optimality of the block sorting data compression algorithm
- Arimura, Yamamoto
- 1998
(Show Context)
Citation Context ...ly distributed (i.i.d.) source in [5]. In these analyses, the symbol extension is introduced to show the asymptotic optimality, or source is assumed to be i.i.d. In the analyses of the BS method [4], =-=[7]-=-–[9], the symbol extension is also used, because it is difficult to evaluate the performance of the MTF transform used in the BS method without the symbol extension. However, the symbol extension is n... |

7 | Mathematics of Information and Coding. - Han, Kobayashi - 2002 |

2 |
Data compression by means of a ‘book stack’,” Probl
- Ryabko
- 1980
(Show Context)
Citation Context ...F) scheme, stationary ergodic sources. I. INTRODUCTION THE move-to-front (MTF) scheme [1] is a data-compression algorithm, which is equivalent to the Recency–Rank scheme [2] and the Book–Stack scheme =-=[3]-=-. The MTF scheme is often used in several efficient data-compression methods. For instance, in the block-sorting (BS) method [6], the MTF scheme with the Burrows–Wheeler transform attains very high co... |

2 |
On the performance of recency-rank and block-sorting universal lossless data compression algorithms
- Muramatsu
- 2002
(Show Context)
Citation Context ...-theoretic analyses [1]–[3]. The average redundancy for stationary sources and the almost-sure redudancy for stationary ergodic sources and asymptotically mean stationary sources are also obtained in =-=[4]-=-. These analyses show that the redundancy approaches to zero as the size of the so-called symbol extension becomes Manuscript received September 8, 2002; revised February 15, 2005. This work was suppo... |

2 | sure convergence coding theorem for block sorting data compression - “Almost - 1998 |