Investigation of block-sorting of multiset permutations

DOI10.1080/00207160410001712279zbMath1098.68033OpenAlexW1986762276MaRDI QIDQ4652742

Meral Arnavut, Ziya Arnavut

Publication date: 28 February 2005

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

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

zbMATH Keywords

Block-sorting, BW Transformation, Multiset Permutations, Lossless Compression

Mathematics Subject Classification ID

Searching and sorting (68P10) Permutations, words, matrices (05A05)

Related Items (1)

From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns

Cites Work

• Unnamed Item
• Second step algorithms in the Burrows-Wheeler compression algorithm
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• A locally adaptive data compression scheme
• Lexical Permutation Sorting Algorithm
• Inversion Coding
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Investigation of block-sorting of multiset permutations