Gray Code In Hypercube Networks
Gray Code in Hypercube Networks is a labeling scheme for the vertices of a hypercube network, belonging to the class of binary encoding methods, that uniquely associates each vertex with a binary string such that adjacent vertices differ by exactly one bit, thereby enabling efficient traversal and routing via Gray code sequences in hypercubic topologies.
13
Publications
835
Citations
27
Authors
23
Institutions
Publications per year
2017–2026
0
Parents
13
Lee distance and topological properties of k-ary n-cubes
B. Bose, Bob Broeg, Younggeun Kwon et al. · IEEE Transactions on Computers · 1995 · 253 citations
1–5 of 13
27
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 27
23
Louisiana State University
Baton Rouge, United States
2 h-index
4 publications
43 citations
University of Michigan
Ann Arbor, United States
2 h-index
4 publications
580 citations
Harvard University
Cambridge, United States
2 h-index
2 publications
44 citations
Oregon State University
Corvallis, United States
2 h-index
3 publications
521 citations
University of Nevada, Las Vegas
Las Vegas, United States
1 h-index
1 publications
10 citations

University of Aizu
Fukushima, Japan
1 h-index
1 publications
17 citations
Hosei University
Tokyo, Japan
1 h-index
2 publications
34 citations

Pennsylvania State University
State College, United States
1 h-index
2 publications
184 citations
1–8 of 23
4 publications · 556 citations
4
h-index
TPDS · 3 publications · 134 citations
3
h-index
Repository · 1 publications · 45 citations
1
h-index
IJHPCN · 1 publications · 17 citations
1
h-index
1 publications · 47 citations
1
h-index
1–5