Syntactic compression codes at the zero entropy point

DOI10.1080/00207168208803312zbMath0488.94009OpenAlexW1975791461WikidataQ126246062 ScholiaQ126246062MaRDI QIDQ3950448

Gabriele Ricci

Publication date: 1982

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168208803312

zbMATH Keywords

image processingprefix codecompression ratiobinary entropy functionrun length codingsyntactic treesautomata hierarchycascade division codingparallel rewriting systemredundant subtreessource substringsyntax of a binary source message

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Information theory (general) (94A15) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Improved prefix encodings of the natural numbers (Corresp.)
• Universal codeword sets and representations of the integers
• Algorithmic Information Theory
• Economical encoding of commas between strings

This page was built for publication: Syntactic compression codes at the zero entropy point