Simple Compression Code Supporting Random Access and Fast String Matching

DOI10.1007/978-3-540-72845-0_16zbMath1203.68048OpenAlexW1535755777MaRDI QIDQ5432317

Fedor Nikitin, Kimmo Fredriksson

Publication date: 2 January 2008

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_16

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (2)

Minimal and Monotone Minimal Perfect Hash Functions ⋮ Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation

This page was built for publication: Simple Compression Code Supporting Random Access and Fast String Matching