For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
Maria Cristeta Cuaresma, Michael Giudici, Cheryl E...
We present two families of constacyclic linear codes with large automorphism groups. The codes are obtained from the twisted tensor product construction. AMS subject classificatio...
A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given autom...
This paper proposes a new radical-based approach for online handwritten Chinese character recognition. The approach is novel in three respects: statistical classification of radic...
This paper discusses the early use of a prototype multiuser virtual environment (MUVE) designed to enhance traditional, office-based adolescent psychotherapy. Keywords Multi-playe...