Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84

An investigation of relationships between graph theory and coding theory

Authors
Publication date
1 October 1975
Publisher

Abstract

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

Similar works

Full text

thumbnail-image

University of South Wales Research Explorer

redirect
oaioai:pure.atira.dk:studentthese...
Last time updated on 05/09/2019

This paper was published in University of South Wales Research Explorer.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.