Use this URL to cite or link to this record in EThOS:
Title: An investigation of relationships between graph theory and coding theory
Author: Hammond, Peter
Awarding Body: Glamorgan Polytechnic
Current Institution: University of South Wales
Date of Award: 1975
Availability of Full Text:
Access from EThOS:
Access from Institution:
The problem of the existence of perfect and nearly perfect codes over finite alphabets is generalised in two directions. This thesis is concerned with the existence and combinatorial properties of completely regular codes in distance-regular graphs. One of the main tools is the generalisation of Lloyd's Theorem. There are connections with designs, orthogonal latin squares and finite projective planes and various existence and non-existence results are derived for completely regular codes in three infinite families of distance-regular graphs.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available