Syntactic compression codes at the zero entropy point

DOI10.1080/00207168208803312MaRDI QIDQ3950448zbMATH OpenOpenAlexWikidataFDO

Authors 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

automata hierarchybinary entropy functioncascade division codingcompression ratioimage processingparallel rewriting systemprefix coderedundant subtreesrun length codingsource substringsyntactic treessyntax 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

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

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

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