Now showing items 1-4 of 4

  • Codes Related to and Derived from Hamming Graphs 

    Muthivhi, Thifhelimbilu Ronald (University of the Western Cape, 2013)
    For integers n, k 2:: 1, and k ~ n, the graph r~has vertices the 2n vectors of lF2 and adjacency defined by two vectors being adjacent if they differ in k coordinate positions. In particular, r~is the classical n-cube, ...
  • Codes, graphs and designs from maximal subgroups of alternating groups 

    Mumba, Nephtale Bvalamanja (University of the Western Cape, 2018)
    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 ...
  • Codes, graphs and designs related to iterated line graphs of complete graphs 

    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 ...
  • Codes, graphs and designs related to iterated line graphs of complete graphs 

    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 ...