UWA Logo What's On at UWA
   UWA HomeProspective Students  | Current Students  | Staff  | Alumni  | Visitors  | About  |     Search UWA    for      
 

SEMINAR: Groups and Combinatorics Seminar: r-Neighbour Transitive codes in the Hamming graph

* Login to add events... *
Today's date is Saturday, January 23, 2021
Groups and Combinatorics Seminar: r-Neighbour Transitive codes in the Hamming graph Other events...
Groups and Combinatorics Seminar

Neil Gillespie (UWA)

will speak on

r-Neighbour Transitive codes in the Hamming graph

at 1pm on Tuesday 19th of October in MLR2

Abstract: A code in the Hamming graph, H(m,q), is a subset of the vertex set of H(m,q). Given any code we can construct a distance partition {C,C_1,....,C_t} of the vertex set of H(m,q). We say C is r-neighbour transitive if there exists a subgroup X of Aut(C) such that X acts transitively on C_i for r between 0 and r. When r=1 we call the code neighbour transitive, and when r=t we call the code completely transitive. In this talk I will mainly discuss recent work on the classification of neighbour transitive codes, and mention a few results on r-neighbour transitive codes. If time permits I will also discuss some results on the classification of completely transitive codes.
Speaker(s) Neil Gillespie
Location Maths Lecture Room 2
Contact Michael Giudici <[email protected]>
Start Tue, 19 Oct 2010 13:00
End Tue, 19 Oct 2010 13:45
Submitted by Michael Giudici <[email protected]>
Last Updated Fri, 15 Oct 2010 12:17
Included in the following Calendars:
Additional Information:
  • Locations of venues on the Crawley and Nedlands campuses are available via the Campus Maps website.
  • Download this event as: Text | iCalendar
  • Mail this event:

Top of Page
© 2001-2010  The University of Western Australia
Questions? Mail [email protected]