This paper is concerned with finding a fingerprint of a sequence. As input data one uses the sequence which has been randomly mixed up by observing it along a random walk path. A sequence containing order exp (n) bits receives a fingerprint with roughly n bits information. The fingerprint is characteristic for the original sequence. With high probability the fingerprint depends only on the initial sequence, but not on the random walk path.
Jyri Lember. Heinrich Matzinger. "Information recovery from randomly mixed-up message text." Electron. J. Probab. 13 396 - 466, 2008. https://doi.org/10.1214/EJP.v13-491