Improved Constructions of Skew-Tolerant Gray Codes

Skew-tolerant Gray codes are Gray codes in which changes in consecutive codewords occur in adjacent positions. We present the first constructions of asymptotically non-vanishing skew-tolerant Gray codes, offering an exponential improvement over previous work.

• Publication year

  2025

• Venue

  International Symposium on Information Theory

• Publication date

  2025-06-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISIT63088.2025.11195625
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Improved Constructions of Skew-Tolerant Gray Codes

  2025cited by this paper
• Combinatorial Gray codes-an updated survey

  2022cited by this paper
• Snakes, coils, and single-track circuit codes with spread $$k$$k

  2015cited by this paper
• Gray Code Compression

  2009cited by this paper
• OPEN PROBLEM

  2008cited by this paper
• Skew-Tolerant Gray Codes

  2006cited by this paper
• Graphs induced by Gray codes

  2002cited by this paper
• Single-track circuit codes

  2001cited by this paper
• The structure of single-track Gray codes

  1999cited by this paper
• Some new circuit codes

  1997cited by this paper
• A Survey of Combinatorial Gray Codes

  1997cited by this paper
• Transition Restricted Gray Codes

  1996cited by this paper
• Near optimal single-track Gray codes

  1996cited by this paper
• A Method for Constructing Circuit Codes

  1967cited by this paper
• Generalized Snake-in-the-Box Codes

  1966cited by this paper
• Unit-Distance Error-Checking Codes

  1958cited by this paper

• No citing papers are available for this paper.