A new algorithm for compression of partially commutative alphabets

DOI10.1016/j.ins.2022.08.054OpenAlexW4292381831WikidataQ113872278 ScholiaQ113872278MaRDI QIDQ6122306

Francisco M. De Assis, Andresso da Silva

Publication date: 27 March 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.08.054

zbMATH Keywords

concurrent systemscompressionequivalence classespartial orderLZ78

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Clique polynomials have a unique root of smallest modulus
• A theory of incremental compression
• EGC: entropy-based gradient compression for distributed deep learning
• GraCT: a grammar-based compressed index for trajectory data
• Combinatorial problems of commutation and rearrangements
• Dependence polynomials
• Can Burrows-Wheeler transform be replaced in chain code compression?
• Compression of Words Over a Partially Commutative Alphabet
• On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• The Number of Words of Length n in a Graph Monoid
• Elements of Information Theory
• CONCUR 2003 - Concurrency Theory
• Space-efficient representations of raster time series

This page was built for publication: A new algorithm for compression of partially commutative alphabets