arXiv (All)
open access
Gray Codes With Constant Delay and Constant Auxiliary Space
We give the first two algorithms to enumerate all binary words of $\{0,1\}^\ell$ (like Gray codes) while ensuring that the delay and the auxiliary space is independent from $\ell$, i.e., constant time for each word, and constant memory in addition to the $\ell$ bits storing the current word. Our alg
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Hamming distance properties of group codes#490073
- Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra#1014533
- Finding approximate repetitions under Hamming distance#665090
- Recursively Extended Permutation Codes under Chebyshev Distance#972892
- Infinite Sum-Product Configurations in Parallel#1048328
Record · ID 1354123
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive