Data compression and Gray-code sorting

DOI10.1016/0020-0190(86)90029-3MaRDI QIDQ1075764zbMATH OpenOpenAlexFDO

Authors Dana Richards

Publication date 1986

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(86)90029-3

zbMATH Keywords

comparison-based sortingradix sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• Compact storage schemes for formatted files by spanning trees
• Counting sequences
• Efficient generation of the binary reflected gray code and its applications
• scientific article; zbMATH DE number 3872698 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• Storage Reduction Through Minimal Spanning Trees and Spanning Forests

Cited in

(7)

• On the \((n,t)\)-antipodal Gray codes
• Variable-length codes independent or closed with respect to edit relations
• Gray cycles of maximum length related to \(k\)-character substitutions
• Space-optimal quasi-Gray codes with logarithmic read complexity
• Reordering columns for smaller indexes
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
• Long paths in hypercubes with a quadratic number of faults

This page was built for publication: Data compression and Gray-code sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075764)