A locally adaptive data compression scheme
From MaRDI portal
Publication:3794067
DOI10.1145/5684.5688zbMath0648.94007OpenAlexW1975965284WikidataQ56454126 ScholiaQ56454126MaRDI QIDQ3794067
No author found.
Publication date: 1986
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/5684.5688
Related Items
On list update with locality of reference, Revisiting the COUNTER algorithms for list update, An exact formula for the move-to-front rule for self-organizing lists, Weighted forward looking adaptive coding, Can Burrows-Wheeler transform be replaced in chain code compression?, Practical and flexible pattern matching over Ziv-Lempel compressed text., Measuring the clustering effect of BWT via RLE, A competitive analysis of the list update problem with lookahead, On updating suffix tree labels, Paid exchanges are worth the price, Efficient chain code compression with interpolative coding, On optimally partitioning a text to improve its compression, List update with probabilistic locality of reference, On some statistical properties of the ``Book Stack transformation, Burrows-Wheeler compression: Principles and reflections, A simpler analysis of Burrows-Wheeler-based compression, From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization, Compressing table data with column dependency, Unnamed Item, On the list update problem with advice, Investigation of block-sorting of multiset permutations, Time-universal data compression, Balancing and clustering of words in the Burrows-Wheeler transform, Dynamic asymmetric communication, A novel legitimacy preserving data hiding scheme based on LAS compressed code of VQ index tables, An experimental study of a compressed index, Optimal encoding of non-stationary sources, Move-to-front, distance coding, and inversion frequencies revisited, Second step algorithms in the Burrows-Wheeler compression algorithm, Using information theory approach to randomness testing, The Vcodex Platform for Data Compression, Asymptotically most powerful tests for random number generators, Some Results for Elementary Operations, Context exhumation after the Burrows-Wheeler transform, A Survey of Algorithms and Models for List Update, Randomized competitive algorithms for the list update problem, Parameterized analysis of paging and list update algorithms