Near optimal single-track Gray codes

DOI10.1109/18.490544zbMATH Open0857.94006OpenAlexW2095694837WikidataQ56084132 ScholiaQ56084132MaRDI QIDQ4887057FDOQ4887057

Authors: Tuvi Etzion, Kenneth G. Paterson 

Publication date: 16 March 1997

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b41e80201950611ee010be2bf12fcf5d127ff855

Recommendations

• The structure of single-track Gray codes
• Single-Track Gray Codes and Sequences
• Single-track Gray codes
• scientific article; zbMATH DE number 4087600
• Gray codes with bounded weights
• Near-Optimal Codes for Information Embedding in Gray-Scale Signals
• On the Optimality of the Binary Reflected Gray Code
• Space-optimal quasi-Gray codes with logarithmic read complexity
• On \(m\)-ary Gray codes
• Optimal codes for correcting single errors and detecting adjacent errors

zbMATH Keywords

quantizationGray codes

Mathematics Subject Classification ID

Source coding (94A29) Combinatorial codes (94B25)

Cited In (6)

• A heuristic approach for constructing symmetric Gray codes
• Snakes, coils, and single-track circuit codes with spread \(k\)
• Title not available (Why is that?)
• The structure of single-track Gray codes
• Single-track circuit codes
• Single-Track Gray Codes and Sequences

This page was built for publication: Near optimal single-track Gray codes

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