Back to results
Glamorgan Polytechnic
An investigation of relationships between graph theory and coding theory
Abstract
dc:description.abstractThe 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.<br/><br/>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.
Degree
thesis:*- Name dc:type.qualificationname
- Doctoral Thesis
- Level dc:type.qualificationlevel
- Student thesis
- Grantor dc:publisher.institution
- Glamorgan Polytechnic
- Year dc:date.issued
- 1975
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Hammond, Peter
Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84
- OAI identifier oai:identifier
- oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84