On the conversion between binary code and binary-reflected Gray code on binary cubes

DOI10.1109/12.368010MaRDI QIDQ4419603zbMATH OpenOpenAlexFDO

Authors S. Lennart Johnsson, Ching-Tien Ho

Publication date 1995

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.368010

zbMATH Keywords

all-port communicationcommunication algorithmrouting algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes
• An efficient algorithm for gray-to-binary permutation on hypercubes
• Binary cube emulation of butterfly networks encoded by Gray code
• A new routing algorithm for cyclic shifts on BRGC hypercubes
• scientific article; zbMATH DE number 4087600

Cited in

(7)

• A new routing algorithm for cyclic shifts on BRGC hypercubes
• Binary cube emulation of butterfly networks encoded by Gray code
• An efficient algorithm for gray-to-binary permutation on hypercubes
• Optimal gray-code labeling and recognition algorithms for hypercubes
• Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes
• EMBEDDING HAMILTONIAN CYCLES, LINEAR ARRAYS AND RINGS IN A FAULTY SUPERCUBE
• On the Hamiltonian cycle mapping onto 3-D torus interconnection network based on base-b reflected gray codes

This page was built for publication: On the conversion between binary code and binary-reflected Gray code on binary cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419603)