Extension and faster implementation of the GRP transform for lossless compression

DOI10.1007/978-3-642-13509-5_30zbMATH Open1286.68120OpenAlexW2114646206MaRDI QIDQ3575259FDOQ3575259

Authors: Hidetoshi Yokoo 

Publication date: 26 July 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_30

Recommendations

• scientific article; zbMATH DE number 1305460
• Universal lossless source coding with the Burrows Wheeler transform
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• A Compression-Boosting Transform for Two-Dimensional Data

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)

Cited In (1)

• A Compression-Boosting Transform for Two-Dimensional Data

This page was built for publication: Extension and faster implementation of the GRP transform for lossless compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575259)