Compression of Words Over a Partially Commutative Alphabet

DOI10.1109/TIT.2004.830754zbMath1303.94026OpenAlexW2109002599MaRDI QIDQ3547591

S. A. Savari

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17)

Related Items (1)

A new algorithm for compression of partially commutative alphabets

This page was built for publication: Compression of Words Over a Partially Commutative Alphabet