Cyclotomic graphs and perfect codes
Author:
- Sanming ZhouSZSanming Zhou
- 1 March 2019
- journal article
- research article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 223 (3) , 931-947
Abstract
No abstract availableAll Related Versions
Funding Information
- Australian Research Council (FT110100629)
This publication has 34 references indexed in Scilit:
- Quotients of Gaussian graphs and their application to perfect codesJournal of Symbolic Computation, 2010
- Gossiping and routing in undirected triple-loop networksNetworks, 2009
- Perfect codes in direct products of cycles—a complete characterizationAdvances in Applied Mathematics, 2008
- Codes Over Algebraic Integer Rings of Cyclotomic FieldsIEEE Transactions on Information Theory, 2004
- Efficient dominating sets in Cayley graphsDiscrete Applied Mathematics, 2003
- Skew-morphisms of regular Cayley mapsDiscrete Mathematics, 2002
- Independent perfect domination sets in Cayley graphsJournal of Graph Theory, 2001
- Complete Rotations in Cayley GraphsEuropean Journal of Combinatorics, 2001
- On forwarding indices of networksDiscrete Applied Mathematics, 1989
- Perfect Codes and Regular Partitions in Graphs and GroupsEuropean Journal of Combinatorics, 1987