Abstract
This thesis studies symmetry properties of errorcorrecting codes, which have digital, and mathematical, applications. A code consists of strings of a fixed length in some alphabet.
A code is 2neighbourtransitive if it satisfies particular symmetry properties. New infinite families of 2neighbourtransitive codes are exhibited, certain subclasses classified, and a full characterisation given in the binary case.
A code is selusive if it exhibits less symmetry than the set of strings at distance s from it. Elusive codes are shown to be related to certain designs, with infinite families of examples provided.
Finally, possible extensions of the main results are discussed.
A code is 2neighbourtransitive if it satisfies particular symmetry properties. New infinite families of 2neighbourtransitive codes are exhibited, certain subclasses classified, and a full characterisation given in the binary case.
A code is selusive if it exhibits less symmetry than the set of strings at distance s from it. Elusive codes are shown to be related to certain designs, with infinite families of examples provided.
Finally, possible extensions of the main results are discussed.
Original language  English 

Qualification  Doctor of Philosophy 
Awarding Institution 

Supervisors/Advisors 

Thesis sponsors  
Award date  18 Dec 2017 
DOIs  
Publication status  Unpublished  2017 