Improved Methods For Generating Quasi-gray Codes

DOI10.1007/978-3-642-13731-0_22zbMath1285.94125arXiv1010.0905OpenAlexW2128902682MaRDI QIDQ3569893

Paz Carmi, Prosenjit Bose, Anil Maheshwari, Pat Morin, Dana Jansens, Michiel H. M. Smid

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.0905

zbMATH Keywords

countingdecision treesGray codescombinatorial generationquasi-Gray codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (5)

Regular numeral systems for data structures ⋮ Integer representations towards efficient counting in the bit probe model ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Integer Representations towards Efficient Counting in the Bit Probe Model ⋮ A Survey of Data Structures in the Bitprobe Model

This page was built for publication: Improved Methods For Generating Quasi-gray Codes