{"id":{"repo_id":"southwales","oai_identifier":"oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84"},"canonical_url":"https://search.dev.ndltd.org/etd/southwales/oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84","repository":{"repo_id":"southwales","name":"University of South Wales","base_url":"https://pure.southwales.ac.uk/ws/oai"},"display":{"title":"An investigation of relationships between graph theory and coding theory","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.<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.","abstract_html":"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&#x27;s Theorem.&lt;br/&gt;&lt;br/&gt;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.","abstract_has_math":false,"creators":["Hammond, Peter"],"institution":"Glamorgan Polytechnic","degree_name":"Doctoral Thesis","degree_level":"Student thesis","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1975,"date_issued":"1975-10","date_published":"1975-10","updated_at":"2026-07-24T04:39:25Z","subjects":[],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84"],"render_values":[{"text":"oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84","href":null,"code":true}]}]},"links":{"outbound_url":"https://pure.southwales.ac.uk/en/studentTheses/a6a77373-9771-4eb4-82cf-9708cb845d84","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Hammond, Peter"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1975-10"]},{"key":"dc:date.issued","label":"Date","values":["1975-10"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["Glamorgan Polytechnic"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://pure.southwales.ac.uk/en/studentTheses/a6a77373-9771-4eb4-82cf-9708cb845d84"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Student thesis"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["Doctoral Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84","https://pure.southwales.ac.uk/en/studentTheses/a6a77373-9771-4eb4-82cf-9708cb845d84"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://pure.southwales.ac.uk/files/3195812/P._Hammond_1975_2059568.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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.<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."]},{"key":"dc:title","label":"Title","values":["An investigation of relationships between graph theory and coding theory"]}]}],"canonical_facts":{"dc:creator":["Hammond, Peter"],"dc:date":["1975-10"],"dc:date.issued":["1975-10"],"dc:description.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.<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."],"dc:identifier":["oai:pure.atira.dk:studenttheses/a6a77373-9771-4eb4-82cf-9708cb845d84","https://pure.southwales.ac.uk/en/studentTheses/a6a77373-9771-4eb4-82cf-9708cb845d84"],"dc:identifier.uri":["https://pure.southwales.ac.uk/files/3195812/P._Hammond_1975_2059568.pdf"],"dc:language":["eng"],"dc:publisher.institution":["Glamorgan Polytechnic"],"dc:relation.isreferencedby":["https://pure.southwales.ac.uk/en/studentTheses/a6a77373-9771-4eb4-82cf-9708cb845d84"],"dc:title":["An investigation of relationships between graph theory and coding theory"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["Student thesis"],"dc:type.qualificationname":["Doctoral Thesis"]},"updated_at":"2026-07-24T04:39:25Z"}