Modeling Toroidal Networks with the Gaussian Integers

DOI10.1109/TC.2008.57zbMath1390.68063OpenAlexW2158988585MaRDI QIDQ4564058

Carmen Martínez, Miquel Moretó, E. Stafford, Ramón Beivide, Ernst M. Gabidulin

Publication date: 12 June 2018

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) General commutative ring theory (13A99)

Related Items (9)

Cyclotomic graphs and perfect codes ⋮ Dense bipartite circulants and their routing via rectangular twisted torus ⋮ Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes ⋮ A COMPUTATION OF THE SHORTEST PATHS IN OPTIMAL TWO-DIMENSIONAL CIRCULANT NETWORKS ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ Unnamed Item ⋮ Identifying codes of degree 4 Cayley graphs over abelian groups ⋮ Effective algorithm for finding shortest paths in dense Gaussian networks

This page was built for publication: Modeling Toroidal Networks with the Gaussian Integers