Binary cube emulation of butterfly networks encoded by Gray code

DOI10.1006/JPDC.1994.1026MaRDI QIDQ1325980zbMATH OpenOpenAlexFDO

Authors S. Lennart Johnsson, Ching-Tien Ho

Publication date 26 January 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1994.1026

zbMATH Keywords

binary cube networksbinary-reflected Gray codebutterfly networkcommunication complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Cyclic codes (94B15)

Recommendations

• On the conversion between binary code and binary-reflected Gray code on binary cubes
• An efficient algorithm for gray-to-binary permutation on hypercubes
• Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes
• Optimal emulations by butterfly-like networks

Cited in

(4)

• An efficient algorithm for gray-to-binary permutation on hypercubes
• Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes
• On the conversion between binary code and binary-reflected Gray code on binary cubes
• On the Hamiltonian cycle mapping onto 3-D torus interconnection network based on base-b reflected gray codes

This page was built for publication: Binary cube emulation of butterfly networks encoded by Gray code

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