Rearranging data to maximize the efficiency of compression

DOI10.1016/0022-0000(89)90009-3zbMath0688.68043OpenAlexW2004280259MaRDI QIDQ1263976

Doron Rotem, Frank Olken

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90009-3

zbMATH Keywords

compressiondeterministic category rearrangement problemfinite discrete domainsmulti-attribute dataoptimal category rearrangementoptimal permutation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Run-length encodings (Corresp.)
• Mapping Multidimensional Space to One Dimension for Computer Output Display
• Alternative Algorithm for Hilbert's Space-Filling Curve
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements