Skip to main content
Article thumbnail
Location of Repository

Let

By 

Abstract

for k = 0, 1, * , 2"- 1- 1; where LxJ is the "floor " function denoting the greatest integer smaller than x. Proof: The recursive formulas will be proved separately. 1) d2k = Ldk/2J-Let the binary representation of k be (4). Then (2k)2-=(knkn--.. k2k 0) (1 The inverse Gray codes of the bit-reverses of (k)2 and (2k)2 are, respectively

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.6513
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://euler.ecs.umass.edu/res... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.