Codes, graphs and designs from maximal subgroups of alternating groups
Mumba, Nephtale Bvalamanja
MetadataShow full item record
The main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first examine the binary codes from the row span of biadjacency matrices and their transposes for some classes of bipartite graphs. In this case we consider a sub-matrix of an adjacency matrix of a graph as the generator of the code. We then shift our attention to uniform subset graphs by exploring the automorphism groups of graph covers and some classes of uniform subset graphs. In the sequel, we explore equal codes from adjacency matrices of non-isomorphic uniform subset graphs and finally consider codes generated by an adjacency matrix formed by adding adjacency matrices of two classes of uniform subset graphs.
Showing items related by title, author, creator and subject.
Kumwenda, Khumbo (University of the Western Cape, 2011)In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood ...
Fadhal, Emad Alden Sir Alkhatim Abraham (University of the Western Cape, 2010)In the course of exploring various symmetries of vertex-transitive graphs, we introduce the concept of quasi-normal subgroups in groups. This is done since the symmetries of vertex-transitive graphs are intimately linked ...
Okitowamba, Onyumbe (University of the Western Cape, 2009)This thesis is a study on the confluence of algebraic structures and graph theory. Its aim is to consider groupoids from factorisations of complete graphs. We are especially interested in the cases where the factors are ...