A loopless gray code for minimal signed-binary representations

ESA'05 Proceedings of the 13th annual European conference on Algorithms（2005）

引用 7|浏览1

暂无评分

摘要

A string ... a2a1a0 over the alphabet {–1,0,1} is said to be a minimal signed-binary representation of an integer n if n = ∑k≥0ak2k and the number of non-zero digits is minimal. We present a loopless (and hence a Gray code) algorithm for generating all minimal signed binary representations of a given integer n.

查看译文

关键词

non-zero digit,loopless gray code,integer n,minimal signed-binary representation,binary representation,gray code

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要