Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes

DOI10.1006/JPDC.2001.1772zbMath1006.68002OpenAlexW2090342193MaRDI QIDQ1604295

R. Venkatesan, Bella Bose, Myung M. Bae

Publication date: 4 July 2002

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

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

zbMATH Keywords

gray codetopologies for interconnecting processors

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99)

This page was built for publication: Data rearrangement between radix-\(k\) and Lee distance gray codes in \(k\)-ary \(n\)-cubes