Thursday, November 28, 2013 1:00 pm
-
1:00 pm
EST (GMT -05:00)
Linear Cayley Graphs, Codes and Geometry
Speaker: | Mario Huang |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5136 |
Abstract:
Let $D$ be a set of nonzero vectors in $GF(q)^k$ that is closed under multiplications by nonzero scalars. The graph with vertex set $GF(q)^k$, such that two vectors are adjacent if and only if their difference is in $D$, is called a linear Cayley graph. In this talk we will see how these graphs are related to coding theory and finite projective geometry.