Codes, graphs and designs related to iterated line graphs of complete graphs

Codes, graphs and designs related to iterated line graphs of complete graphs

Show other versions (2)

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 designs of the line graphs Li+1(Kn) using certain elementary relations. Co...

Full description

Bibliographic Details
Main Author: Kumwenda, Khumbo
Format: Others
Language:English
Published: 2011
Subjects:
Automorphism groups
Categorical product of graphs
Designs
Graphs
Incidence design
Iterated line graph
Linear code
Neighbourhood design
Permutation decoding
PD-sets
Strong product of graphs.
Online Access:http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_1742_1320645699

Internet

http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_1742_1320645699

Similar Items