engleski

Transitive distance-regular graphs and related codes

In this talk we will explain the method for constructing transitive distance-regular graphs (including strongly regular graphs) from groups. In this talk, we will discuss interesting results, obtained using the described method, on which some finite simple groups, such as sporadic simple groups, act transitively. Further, we will discuss a possibility of permutation decoding of the codes spanned by the adjacency matrices of these graphs and find PD-sets for some of the constructed codes. Moreover, we will apply this method to obtain self-orthogonal codes.

distance-regular graph ; Mathieu group ; linear code

nije evidentirano