Two Combinatorial Criteria for BWT Images

DOI10.1007/978-3-642-20712-9_30zbMath1332.68272OpenAlexW192433608MaRDI QIDQ3007642

Arseny M. Shur, Konstantin M. Likhomanov

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_30

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ When a dollar makes a BWT

Cites Work

• Unnamed Item
• Burrows-Wheeler transform and Sturmian words
• Words with simple Burrows-Wheeler transforms
• A note on the Burrows-Wheeler transformation
• An analysis of the Burrows—Wheeler transform
• Balanced Words Having Simple Burrows-Wheeler Transform
• Words over an ordered alphabet and suffix permutations

This page was built for publication: Two Combinatorial Criteria for BWT Images