Performance Analysis of Grammar-Based Codes Revisited

DOI10.1109/TIT.2004.830781zbMATH Open1303.94060OpenAlexW2160902920MaRDI QIDQ3547013FDOQ3547013

Authors: Dake He, Enhui Yang 

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.2004.830781

Recommendations

• Grammar-based codes: a new class of universal lossless source codes
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
• The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
• Structured grammar-based codes for universal lossless data compression.
• scientific article; zbMATH DE number 2119662

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

Cited In (1)

• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models

This page was built for publication: Performance Analysis of Grammar-Based Codes Revisited

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