Move-to-front transform

Known as: Move-to-front coder, Move-to-front heuristic, Move to front 
The move-to-front (MTF) transform is an encoding of data (typically a stream of bytes) designed to improve the performance of entropy encoding… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2017
051019742017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Chain codes are the most size-efficient representations of rasterised binary shapes and contours. This paper considers a new… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 3
Is this relevant?
2012
2012
We propose to use two reversible algorithms, (BWT: Burrows-Wheeler and MTF: Move to Front), principally developed for the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2009
2009
This paper introduces a new unobtrusive and cost-effective method for the capture and compression of program execution traces in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
The field of data compression has developed many algorithms so far and still the process seems to be always increasing in search… (More)
  • table III
  • table I
  • table II
Is this relevant?
2007
2007
In this paper we present a new lossless audio coder using the Burrows-Wheeler transform (BWT). Audio signals under consideration… (More)
  • table II
  • table I
  • figure 1
  • figure 1
  • figure 3
Is this relevant?
2007
2007
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of… (More)
Is this relevant?
2006
2006
Consider a list of n files whose popularities are random. These files are updated according to the move-tofront rule and we… (More)
Is this relevant?
2000
2000
Motivated by the Move-to-Front (MTF) coder's (recency ranking) utilization of small size permutations which are restricted to the… (More)
  • table 1
  • table 2
Is this relevant?
1996
1996
We derive upper and lower bounds on total variation distance to stationarity for the distribution of search cost under the move… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
1989
1989
We give systolic implementations for three variants of the move-to-front coding algorithm discussed in recent journal articles by… (More)
  • figure 1
  • figure 2
Is this relevant?