Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups

DOI10.1109/TC.1987.1676977zbMath0632.94036MaRDI QIDQ3770457

A. Yavuz Oruç, Melda Yaman Oruç

Publication date: 1987

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

zbMATH Keywords

linear time algorithms; cellular permutation arrays; iterative coset decompositions of symmetric groups

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

94C30: Applications of design theory to circuits and networks

05B45: Combinatorial aspects of tessellation and tiling problems

20B30: Symmetric groups

Related Items

On generation of permutations through decomposition of symmetric groups into cosets