Loading...
Please wait, while we are loading the content...
Similar Documents
A Note on Iterating an-ary Gray
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chi, Code |
| Copyright Year | 2007 |
| Abstract | In this note we consider the number of distinct-ary codes produced by repeatedly applying the Gray code mapping of Sharma and Khanna 4]. This number was derived before by Lichtner 3], and we give a simpler proof here. Our key observation is a simple connection between this number and the period of binomial coeecients modulo. Then the result follows immediately from a known periodic property of binomial coeecients modulo 2, 5, 6]. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.csie.ncnu.edu.tw/~tsai/papers/g.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |