Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems

DOI10.1093/COMJNL/35.3.299MaRDI QIDQ4019955zbMATH OpenOpenAlexFDO

Authors

Publication date 16 January 1993

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/35.3.299

zbMATH Keywords

data allocationpartial match queriesnearest neighbour searchingsymbolic Gray code

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Searching and sorting (68P10) Theory of data (68P99)

Recommendations

• Gray codes and symmetric chains
• Gray codes and symmetric chains
• A heuristic approach for constructing symmetric Gray codes
• Doubly adjacent gray codes for the symmetric group
• Codes for Symbol-Pair Read Channels
• scientific article; zbMATH DE number 4139306
• Symmetric disjunctive list-decoding codes
• Index system and separability of constant weight Gray codes
• The structure of single-track Gray codes
• Some complementary Gray codes

Cited in

(3)

• Variable-length codes independent or closed with respect to edit relations
• Space-optimal quasi-Gray codes with logarithmic read complexity
• On the \((n,t)\)-antipodal Gray codes

This page was built for publication: Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems

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