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

Authors

27

  1. BB
    B. Bose

    Oregon State University, United States

    2 publications · 268 citations

    2

    h-index

  2. KG
    Kang G. Shin

    University of Michigan, United States

    2 publications · 290 citations

    2

    h-index

  3. MC
    Ming-Syan Chen⋆

    National Taiwan University, Taiwan

    2 publications · 290 citations

    2

    h-index

  4. SL
    S. Lennart Johnsson

    Yale University, United States

    2 publications · 44 citations

    2

    h-index

  5. AE
    Alan Edelman

    Massachusetts Institute of Technology, United States

    1 publications · 31 citations

    1

    h-index

1–5 of 27

Venues

  1. IEEE Transactions on Computers

    4 publications · 556 citations

    4

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 134 citations

    3

    h-index

  3. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 45 citations

    1

    h-index

  4. 1

    h-index

  5. Parallel Computing

    1 publications · 47 citations

    1

    h-index

1–5