Gray codes and 1D quadratic maps

1998 ◽  
Vol 34 (13) ◽  
pp. 1304 ◽  
Author(s):  
G. Álvarez ◽  
M. Romera ◽  
G. Pastor ◽  
F. Montoya
Keyword(s):  
Gray Codes ◽  
Quadratic Maps

On locally balanced gray codes

2016 ◽  
Vol 10 (1) ◽  
pp. 78-85 ◽  
Author(s):  
I. S. Bykov
Keyword(s):  
Gray Codes

A PARALLEL ALGORITHM TO GENERATE N-ARY REFLECTED GRAY CODES IN A LINEAR ARRAY WITH RECONFIGURABLE BUS SYSTEM

1993 ◽  
Vol 03 (02) ◽  
pp. 157-164 ◽  
Author(s):  
P. THANGAVEL ◽  
V.P. MUTHUSWAMY
Keyword(s):  
Parallel Algorithm ◽  
Linear Array ◽  
Constant Time ◽  
Processor Array ◽  
Gray Codes ◽  
System A ◽  
Processor Arrays ◽  
Bus System

A simple parallel algorithm for generating N-ary reflected Gray codes is presented. The algorithm is derived from the pattern of N-ary reflected Gray codes. The algorithm runs on a linear processor array with a reconfigurable bus system. A reconfigurable bus system is a bus system whose configuration can be dynamically changed. Recently processor arrays with reconfigurable bus systems were used to solve many problems in constant time. There already exists experimental reconfigurable chips.

Random Iterations of Two Quadratic Maps

1993 ◽  
pp. 13-22 ◽  
Author(s):  
Rabi N. Bhattacharya ◽  
B. V. Rao
Keyword(s):  
Quadratic Maps

scholarly journals Balancing Cyclic $R$-ary Gray Codes

10.37236/949 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Mary Flahive ◽  
Bella Bose
Keyword(s):  
Gray Codes

New cyclic $n$-digit Gray codes are constructed over $\{0, 1, \ldots, R-1 \}$ for all $R \ge 3$, $n \ge 2$. These codes have the property that the distribution of the digit changes (transition counts) is close to uniform: For each $n \ge 2$, every transition count is within $R-1$ of the average $R^n/n$, and for the $2$-digit codes every transition count is either $\lfloor{R^2/2} \rfloor$ or $\lceil{R^2/2} \rceil$.

Sign in / Sign up

Export Citation Format

Share Document