menu image ANU logo

Linear Codes

My research started with my master's degree and was in the area of pattern classes of permutations. The scenery has subsequently changed for my PhD and I am now doing research on practical algorithms for deciding the linear code equivalence problem. This research builds on the already existing mechanisms that are found in nauty (a program by Brendan McKay for deciding graph isomorphism and finding graph automorphisms). I have written a C library that extends the functionality of nauty to binary linear codes, and it should be released here soon, although not during this year as was originally hoped. However, the program is certainly at a stage where it works so if you happen to have a binary code that you would like to test the program against then please send me an email.