Single-track circuit codes

DOI10.1109/18.945274MaRDI QIDQ4544703zbMATH OpenOpenAlexWikidataFDO

Authors Alain P. Hiltgen, Kenneth G. Paterson

Publication date 4 August 2002

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

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

zbMATH Keywords

error correctionsnake-in-the-box codecircuit codesangular quantizationsingle-track Gray codesdigital encoding

Mathematics Subject Classification ID

Source coding (94A29) Paths and cycles (05C38) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25)

Recommendations

• Single-track Gray codes
• Single-Track Gray Codes and Sequences
• The structure of single-track Gray codes
• Near optimal single-track Gray codes
• A New Method for Constructing Circuit Codes

Cited in

(7)

• The maximum length of circuit codes with long bit runs and a new characterization theorem
• Isomorphism of maximum length circuit codes
• scientific article; zbMATH DE number 6295081 (Why is no real title available?)
• Snakes, coils, and single-track circuit codes with spread \(k\)
• The structure of single-track Gray codes
• Single-Track Gray Codes and Sequences
• scientific article; zbMATH DE number 1440912 (Why is no real title available?)

This page was built for publication: Single-track circuit codes

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