Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
From MaRDI portal
Publication:3547843
DOI10.1109/TIT.2003.818411zbMath1301.94069OpenAlexW2130433404MaRDI QIDQ3547843
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.818411
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24) Source coding (94A29)
Related Items (1)
This page was built for publication: Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models