Data compression and Gray-code sorting
From MaRDI portal
Publication:1075764
DOI10.1016/0020-0190(86)90029-3zbMath0592.68055OpenAlexW1979021998MaRDI QIDQ1075764
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
Related Items (8)
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Reordering columns for smaller indexes ⋮ Long paths in hypercubes with a quadratic number of faults ⋮ 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
Cites Work
This page was built for publication: Data compression and Gray-code sorting