Selected Publications

Sian Jones


S. K. Jones and S. Perkins. A P-box and S-box approach to encryption using Sudoku grids. Submitted 2016.

C. R. Thomas, S. K. Jones, and S. Perkins. Can a Tromino be tiled with unit Trominoes? Mathematical Spectrum, 48(2):78-81, August 2015/16.

S. K. Jones, P. A. Roach, and S. Perkins. On the number of 6 × 6 sudoku grids. Journal of Combinatorial Mathematics and Combinatorial Computing, 89:33-44, August 2014.

S. K. Jones, S. Perkins, and Paul. On the number of Sudoku grids. Mathematics Today, April:94-95, 2014.

L.H. Harris, S. Perkins, P. A. Roach and S.K. Jones, Bishop Independence. British Journal of Mathematics & Computer Science, 2013, 3(4): 835-843.

S. K. Jones, S. Perkins and P.A Roach, “The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group,” International Journal of Combinatorics, vol. 2012, Article ID 760310, 6 pages, 2012. doi:10.1155/2012/760310.

D. Williams, S.K. Jones, P. A. Roach, and S. Perkins, (2011) Blocking Intercalates In Sudoku Erasure Correcting Codes, International Journal of Computer Science (IJCS), Vol. 38, No. 3, pp. 183-191.

S. K. Jones, S. Perkins and P.A Roach,(2011) Properties, Isomorphisms and Enumeration of 2-Quasi-Magic Sudoku Grids, Discrete Mathematics, vol 311, pp. 1098-1110

Roach, P. A., Grimstead, I. J., Jones, S. K., and Perkins, S. (2009) A Knowledge-Rich Approach to the Rapid Enumeration of Quasi-Magic Sudoku Search Spaces. Proceedings of ICAART 2009, the 1st International Conference on Agents and Artificial Intelligence, Porto, Portugal, 19-21 January 2009, (INSTICC Press, Filipe, J., Fred, A. and Sharp, B. Eds.).246-254

S. K. Jones, P.A Roach, and S. Perkins (2007) Construction of Heuristics for a Search-Based Approach to Solving SuDoku. Accepted for Research and Development in Intelligent Systems XXIV: Proceedings of AI-2007, the Twenty-seventh SGAI International Conference on Artificial Intelligence, (Springer-Verlag, Bramer, M., Coenen, F., and Petridis, M. Eds),

Stephanie Perkins


C. Rebecca Thomas, Siân K. Jones and Stephanie Perkins (2016) Can a Tromino be Tiled with Unit Trominoes? Mathematical Spectrum, Volume 48, Number 2, 78-81

F.H. Hunt, S. Perkins and D.H. Smith Channel Models and Error Correction Codes for DNA Information Storage, Int. J. Information and Coding Theory, Vol 3, No.2, 2015

S.K Jones, S.Perkins, P.A. Roach, (2014) On the Number of 6 × 6 Sudoku Grids. Journal of Combinatorial Mathematics and Combinatorial computing Vol 89, pp 33-44

S. K. Jones, S. Perkins, and P. A. Roach. On the number of Sudoku grids. Mathematics Today, April:94–95, 2014

L.H. Harris, S. Perkins, P. A. Roach and S.K. Jones, Bishop Independence. British Journal of Mathematics & Computer Science, 2013, 3(4): 835-843.

F. H. Hunt, S. Perkins and D. H. Smith, Decoding Mixed Errors in Permutation Codes, Designs, Codes and Cryptography, 2013, DOI 10.1007/s10623-013-9872-x

S. K. Jones, S. Perkins and P.A Roach, “The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group,” International Journal of Combinatorics, vol. 2012, Article ID 760310, 6 pages, 2012. doi:10.1155/2012/760310.

N. Aboluion, D.H. Smith and S. Perkins, (2012) Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint, Discrete Mathematics, Vol. 312, (2012), pp. 1062-1075 (ISSN: 0012-365X) doi:10.1016/j.disc.2011.11.021

L.A. Phillips, S. Perkins, P.A. Roach and D.H. Smith, Sudoku puzzles as erasure correcting codes, Journal of Recreational Mathematics, Vol. 36, No. 2 (volume date 2007), (published 2011) pp. 83-88. (ISSN 0022-412X).

D. Williams, S.K. Jones, P. A. Roach, and S. Perkins, (2011) Blocking Intercalates In Sudoku Erasure Correcting Codes, International Journal of Computer Science (IJCS), Vol. 38, No. 3, pp. 183-191.

S. K. Jones, S. Perkins and P.A Roach,(2011) Properties, Isomorphisms and Enumeration of 2-Quasi-Magic Sudoku Grids, Discrete Mathematics, vol 311, pp. 1098-1110

D.H. Smith, N. Aboluion, R. Montemanni and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content, Discrete Mathematics, Vol. 311, (2011), pp. 1207-1219 (ISSN: 0012-365X) doi: 10.1016/j.disc.2010.03.005

D.H. Smith, F.H. Hunt and S. Perkins, Exploiting spatial separations in CDMA systems with correlation constrained sets of Hadamard matrices, IEEE Transactions on Information Theory, Vol. 56, No. 11, (November 2010), pp. 5757-5761 (ISSN: 0018-9448) doi: 10.1109/TIT.2010.2070310

S.O. Sanusi, D.H. Smith, R.A. Jones and S. Perkins, The application of frequency assignment techniques in spreading code assignment, Wireless Personal Communications, Vol. 54, No. 3, (2010), pp. 397-415 (ISSN 0929-6212)
doi: 10.1007/s11277-009-9732-1

R. P. Davies, P. A. Roach and S. Perkins, The Use of Problem Domain Information in the Automated Solution of Kakuro Puzzles, International Journal of Computer Science (IJCS), Vol. 37, No. 2, pp 118-127. June 2010
http://www.iaeng.org/IJCS/issues_v37/issue_2/index.html

M.B.J. Higgs, S. Perkins, D.H. Smith, The construction of variable length codes with good synchronization properties, IEEE Transactions on Information Theory, Vol. 55, No. 4, (April 2009), pp. 1696-1700 (ISSN: 0018-9448)
doi: 10.1109/TIT.2009.2013050

D.H. Smith, R.P. Ward, S. Perkins, Gold Codes, Hadamard Partitions and the security of CDMA systems, Designs, Codes and Cryptography June 2009: 51:231-243. (ISSN 0925-1022) doi:10.1007/s10623-008-9257-8

Roach, P. A., Grimstead, I. J., Jones, S. K., and Perkins, S. (2009) A Knowledge-Rich Approach to the Rapid Enumeration of Quasi-Magic Sudoku Search Spaces. Proceedings of ICAART 2009, the 1st International Conference on Agents and Artificial Intelligence, Porto, Portugal, 19-21 January 2009, (INSTICC Press, Filipe, J., Fred, A. and Sharp, B. Eds.).246-254

Davies, R. P., Roach P. A. and Perkins, S. (2008) Automation of the Solution of Kakuro Puzzles. Research and Development in Intelligent Systems XXV: Proceedings of AI-2008, the Twenty-eighth SGAI International Conference on Artificial Intelligence, (Springer-Verlag, Bramer, M., Coenen, F. and Petridis, M. Eds.).
pp 219-232. (ISBN 978-1-84882-170-5)

D.H. Smith and S. Perkins, Cyclically permutable representations of cyclic codes, Discrete Applied Mathematics, Vol 156, No 1, Jan 2008, pp 76-81 (ISSN:0166-218X)

S. K. Jones, P.A Roach, and S. Perkins (2007) Construction of Heuristics for a Search-Based Approach to Solving SuDoku. Accepted for Research and Development in Intelligent Systems XXIV: Proceedings of AI-2007, the Twenty-seventh SGAI International Conference on Artificial Intelligence, (Springer-Verlag, Bramer, M., Coenen, F., and Petridis, M. Eds),

D.H. Smith, L.A. Hughes and S. Perkins, A New Table of Constant Weight Codes of Length Greater than 28, Electronic Journal of Combinatorics, 13(1) #A2 May 2006 (ISSN: 1077-8926)
(Also: In The Journal of Combinatorics” ISSN: 1097-1440)

S. Perkins, A. L. Sakhnovich, and D. H. Smith, On an upper bound for mixed error-correcting codes, IEEE Transactions on Information Theory, Vol. 52, No.2, 2006, pp. 708-712. (ISSN: 0018-9448)

S. Perkins and D. H. Smith, Robust Data Compression: Variable Length Codes and Burst Errors, The Computer Journal, Vol. 48, No. 3, 2005, pp. 315-322.

S. Perkins, D. H. Smith and A. Ryley, Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes, The Computer Journal, Vol. 47, No. 3, May 2004, pp. 309-319. (ISSN: 0010-4620)

R. A. Jones, D.H. Smith and S. Perkins, “Assignment of Spreading codes in DS-CDMA UWB systems”, Proceedings of IEEE Conference on Ultra Wideband Systems and Technologies, Reston, Virginia, Nov 2003 (ISBN 0-7803-8818-2)

D. H. Smith and S. Perkins, “Applications of Coding Theory in Mobile Radio Communications”, Mathematics Today (IMA), Vol. 37, No. 3, 2001, pp 84-87. (ISSN 1361-2042)

S Perkins and A. E Escott, “Extended Synchronizing Codewords for q-ary Complete Prefix Codes”, Discrete Maths, Vol. 231, 2001, pp 391-401.

S. Perkins and D H Smith, “A Scheme for the Synchronization of Variable Length Codes”, Discrete Applied Maths, Vol 101, 2000, pp231-245.

S Perkins and A E Escott, “Synchronizing Codewords of q-ary Huffman Codes”, Discrete Maths, Vol. 197/198, 1999, pp 637-655.

A E Escott and S Perkins, “Binary Huffman Equivalent Codes with a Short Synchronizing Codeword”, IEEE Trans. Information Theory, Vol. 44, No. 1, 1998, pp 346-351.

S. Perkins, “Codes with a Disparity Property”, Designs, Codes and Cryptography, Vol. 11, 1997, pp 79-97.

A E Escott and S Perkins, “Binary Huffman Codes with Two Short Synchronizing Codewords”, Proc. 1996 Int. Symp. on Information Theory and Its Applications, Victoria, Canada, pp 294-297.

A E Escott and S Perkins “Constructing Good Binary Synchronous Huffman Codes”, Proc. Int. Symp. on Synchronization, Essen, Germany, (ed. K. A. S. Immink and A. J. Vinck) 1995, pp 105-110.

S Perkins “Q-ary Bandpass Line Codes”, Codes and Cyphers, Proc. Fourth IMA conference on Cryptography and Coding (ed. P. G. Farrell), 1995, pp 341-347.

S Perkins “Bandpass Line Codes for q-ary Alphabets”, Electronic Letters, Vol. 29, No. 20, 1993, pp 1740 – 1741.

Francis Hunt


F. H. Hunt, S. Perkins and D. H. Smith (2013), Decoding mixed errors and erasures in permutation codes, Designs, Codes and Cryptography, Online First 1 September 2013 doi: 10.1007/s10623-013-9872-x ISSN: 0925-1022 (Print) 1573-7586 (Online)

F. H. Hunt and D. H. Smith (2013), The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions, Wireless Personal Communications, Vol. 72(4) (October 2013), pp. 2215-2227, doi: 10.1007/s11277-013-1144-6 Print ISSN 0929-6212 Online ISSN 1572-834X

F.H. Hunt and D.H. Smith (2012), The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions, IEEE Transactions on Wireless Communications, Vol. 11,No. 8, (2012) pp. 2970-2975 (ISSN 1536-1276 ) doi: 10.1109/TWC.2012.062012.111928

R. Montemanni, M. Salani, D.H. Smith, and F. Hunt. (2012), A variable neighbourhood search heuristic for the design of codes, Proceedings of the 8th International Conference on Computing and Information Technology (IC2IT 2012), 9-10 May 2012, Pattaya City, Thailand , pp 127-132. ISBN 978-616-7701-01-1

Derek H. Smith, Francis H. Hunt, Stephanie Perkins (2010), Exploiting Spatial Separations in CDMA Systems with Correlation Constrained Sets of Hadamard Matrices, IEEE Transactions on Information Theory, 56(11), Nov 2010

Mitchell, R., Hunt, F. and Probert, D.R.P, (2010) ‘Valuing and comparing small portfolios’, Research Technology Management, 53(2) , pp. 43-54

Probert D.R., F.H. Hunt, P. Fraser, A. Fleury and T. Holden, (2007) Sourcing software content for manufactured products, Journal of Engineering Manufacture Proceedings of the Institution of Mechanical Engineers – Part B, 221(B5), May 2007

Hunt, F.H., V. Thorn, R. Mitchell, D. R. Probert and R. Phaal, (2007) Internal Technology Valuation: Real World Issues, PICMET 2007, Portland USA, August 5-9 2007

Hunt, F.H., (2007), Support solutions: implications for requirements engineering,Systems engineering for future capability conference, Loughborough University, 12-13 February 2007

Hunt, F.H., R. Mitchell, R. Phaal and D.R. Probert, (2004), Early valuation of technology: real options, hybrid models and beyond, Journal of Instrument and Control Engineers, 43(10) pp 730-735

Hunt, F.H., N. Shehabuddeen, C.J.P. Farrukh, D.R. Probert and S. Wilson, (2004) A process for Sourcing Software for Embedding in Products, PICMET 2004, Seoul Korea, August 1-4 2004

Hunt, F.H., D.R. Probert, J.C. Wong and Phaal, R. (2003) Valuation of technology: exploring a practical hybrid model, PICMET 2003, Portland USA, July 20-24 2003

Hunt, F.H., D.R Probert, S. Barratt, (2003) Adopting new technology: the case of open source at Marconi, International Association for the Management of Technology conference, Nancy, France, May 13-15 2003

Hunt, F.H. and P. Johnson, (2002) On the Pareto distribution of Sourceforge projects, International Workshop on Open Source Software Development, University of Newcastle, 25-26 February 2002

Hunt, F.H., C.J.P. Farrukh and R. Phaal , (2001), Technology Re-use: developing a practical approach to making the most of your technological assets IAMOT 2001, Lausanne

Francis Hunt, David Pearson (1996) A Condition for a Unique Equilibrium Point in a Recurrent Neural Network
DOI:10.1109/ICNN.1996.549087 In proceeding of: IEEE International Conference on Neural Networks, 1996., , Volume: 2

R. Swiniarski, F.Hunt, D. Chalvet, D. Pearson (1995) Intelligent data processing and dynamic process discovery using rough sets, statistical reasoning and neural networks in a highly automated production system. In Proceedings of the 1st European Conference on Application of Neural Networks in Industry, Helsinki 1995.

Nick Gill


The list below includes all papers accepted for publication as of January 2015.


  • (with Azizollah Azad and John Britnell). Nilpotent covers and non-nilpotent subsets of finite groups of Lie type, to appear in Forum Mathematicum.
  • (with Laszlo Pyber, Ian Short and Endre Szabo). On the product decomposition conjecture for finite simple groups. Groups, Geometry, and Dynamics, 7 (2013), no.4, 867–882.
  • Orientably regular maps with Euler characteristic divisible by few primes. Journal of the London Mathematical Society, 88 (2013), no.1, 118–136.
  • (with Ian Short). Conjugacy in Thompson’s group F. Proceedings of the American Mathematical Society, 141 (2013)1529–1538.
  • Transitive projective planes and insoluble groups. Transactions of the American Mathematical Society (2013, in press).
  • (with Harald Helfgott and Misha Rudnev). On growth in an abstract plane. Proceedings of the American Mathematical Society (2013, in press).
    (2,m,n)-groups with Euler characteristic equal to ?2asb. Electronic Journal of Combinatorics, 20 (2013), no. 3, R8.
  • A note on the Weiss conjecture. Journal of the Australian Mathematical Society (2013, in press).
    (with John Bamberg, Thomas P. Hayes, Harald Helfgott, Akos Seress and Pablo Spiga). Bounds on the diameter of Cayley graphs of the symmetric group. Journal of Algebraic Combinatorics (2013, in press).
  • (with Anupam Singh). Real and strongly real classes in SLn(q). Journal of Group Theory, 14 (2011), no.3, pp. 437–459.
  • (with Anupam Singh) Real and strongly real classes in PGLn(q) and quasi-simple covers of PSLn(q). Journal of Group Theory, 14 (2011), no.3, 461–489.
  • (with Harald Helfgott) Growth of small generating sets in SLn(?/p?). International Mathematics Research Notices, 18 (2011), 4226–4251.
  • (with Ian Short) Reversible maps and composites of involutions in groups of piecewise linear homeomorphisms of the real line. Aequationes Mathematicae, 79(2010), no.1-2, 23–37.
  • (with Anthony G. O’Farrell and Ian Short) Reversibility in the group of homeomorphisms of the circle. Bulletin of the London Mathematical Society, 41 (2009), no.5, 885–897.
  • (with Alan Camina and Alex Zalesski) Large dimensional classical groups and linear spaces. Bulletin of the Belgian Mathematical Society (Simon Stevin), 15 (2008), no.4, 705–731.
  • Transitive projective planes. Advances in Geometry, 7 (2007), no.4, 475–528.
  • PSL and line-transitive linear spaces. Beiträge zur Algebra und Geometrie, 48 (2007), no.2, 591–620.
  • Polar spaces and embeddings of classical groups. New Zealand Journal of Mathematics, 36 (2007), 175–184.
  • Linear spaces with significant characteristic prime. Innovations in Incidence Geometry, 3 (2006), 109–119.
  • Nilpotent Singer groups. Electronic Journal of Combinatorics, 13 (2006), no.1, R94.

Derek Smith, Stephanie Perkins and Francis Hunt


S. Perkins and A.E. Escott, Extended synchronizing codewords for q-ary complete prefix codes, Discrete Mathematics, Vol. 231 (2001) pp391-401. (ISSN 0012-365X).

S. Hurley, R. M. Whitaker and D.H. Smith, Analysing Multiple Interference in Radio Networks, 9th International Conference on Telecommunications Systems, Modelling and Analysis, March 15-18, 2001, Dallas, Texas, U.S.A., pp623-628.

D.B. Kidner, C. Eynon and D.H. Smith, Multiscale Terrain Databases, (Extended Abstract), Proceedings of the GIS Research UK 9th Annual Conference (GISRUK 2001), 18-20 April 2001, (Ed. D.B. Kidner and G. Higgs) , pp151-153 (ISBN 1-84054-26-5).

L.A. Hughes, D.H. Smith and A. Ryley, Robust Data Compression for Digital Elevation Models, (Extended Abstract), Proceedings of the GIS Research UK 9th Annual Conference (GISRUK 2001), 18-20 April 2001, (Ed. D.B. Kidner and G. Higgs) , pp462-467. (ISBN 1-84054-26-5).

D.H. Smith, R.K. Taplin and S. Hurley, Frequency Assignment with Complex Co-Site Constraints, IEEE Transaction on Electromagnetic Compatibility,Vol. 43, No. 2, May 2001, pp210-218. (ISSN 0018-9375)

D.H. Smith and S. Perkins, Applications of Coding Theory in Mobile Radio Communications, Mathematics Today, Vol. 37, No. 3, June 2001, pp84-87. (ISSN 1361-2042).

S. Hurley, R.M. Whitaker and D.H. Smith, Channel Loading in Private Mobile Radio Networks, Annals of Operations Research, 107 October 2001, pp 211-224, (ISSN 0254-5330).

R. Montemanni, D.H. Smith and S.M. Allen, Lower Bounds for Fixed Spectrum Frequency Assignment, Annals of Operations Research, 107, October 2001, pp 237-250, (ISSN 0254-5330).

D.H. Smith, S.M. Allen and S. Hurley, Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem , Annals of Operations Research, 107, October 2001, pp 285-301, (ISSN 0254-5330).

R. Bradbeer, S. Hurley, D.H. Smith and G.Wyman, Improving Efficiency in Frequency Assignment Engines, IEEE MILCOM 2001: Communications for Network Centric Operations, CD-ROM Proceedings, October 2001. ISBN 0-7803-7227-1.

D.H. Smith, S.M. Allen and S. Hurley, Lower Bounds for Channel Assignment, in Methods and Algorithms for Radio Channel Assignment, (ed. S. Hurley and R. Leese), Oxford University Press, pp. 45-62, 2002. ( ISBN 0 19 850314 8)

S. Hurley and D.H. Smith, Meta-heuristics and Channel Assignment, in Methods and Algorithms for Radio Channel Assignment, (ed. S. Hurley and R. Leese), Oxford University Press, pp. 22-44, 2002. ( ISBN 0 19 850314 8)

S.M. Allen, D.H. Smith and S. Hurley, Generation of Lower Bounds for Minimum Span Frequency Assignment, Discrete Applied Mathematics, Vol. 119, Nos. 1-2, June 2002, pp59-78.
(ISSN: 0166-218X )

R. Montemanni, D.H. Smith and S.M. Allen, An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference, IEEE Transaction on Vehicular Technology, Vol. 51, No. 5, Sept 2002, pp949-953. (ISSN 0018-9545).

R. Montemanni, J.N.J. Moon and D.H. Smith, An improved tabu search algorithm for the fixed spectrum frequency assignment problem, IEEE Transactions on Vehicular Technology, Vol. 52, No. 4, July 2003, pp891-901. (ISSN 0018-9545).

D.B. Kidner, D.H. Smith, Advances in the Data Compression of Digital Elevation Models, Computers & Geosciences, 29, October 2003, 985-1002. (ISSN: 0098-3004)

R.A. Jones, D.H. Smith and S. Perkins, Assignment of spreading codes in DS-CDMA UWB systems, Proceedings of IEEE Conference on Ultra Wideband Systems and Technologies, Reston, Virginia, C4, November 2003. (ISBN 0-7803-8818-2)

S. Perkins, D. H. Smith and A. Ryley, Robust Data Compression: Consistency Checking in the Synchronization of Variable Length Codes, The Computer Journal, Vol. 47, No. 3, May 2004, pp. 309-319. (ISSN: 0010-4620).

R. Montemanni, D.H. Smith and S.M. Allen, An Improved Algorithm to Determine Lower Bounds for the Fixed Spectrum Frequency Assignment Problem, European Journal of Operational Research, 156, August 2004, pp 736-751, (ISSN: 0377-2217).

S. Perkins and D.H. Smith, Robust Data Compression: Variable Length Codes and Burst Errors, The Computer Journal, Vol. 48, No. 3, (May 2005), pp. 315-322. (ISSN: 0010-4620).

J.N.J. Moon, L.A. Hughes and D.H. Smith, Assignment of Frequency Lists in Frequency Hopping Networks, IEEE Transactions on Vehicular Technology, Vol. 54, No. 3, May 2005, pp. 1147-1159. (ISSN 0018-9545).

S. Perkins, A.L. Sakhnovich and D.H. Smith, On an Upper Bound for Mixed Error-Correcting Codes, IEEE Transaction on Information Theory, Vol. 52, No. 2, (February 2006), pp. 708—712. (ISSN: 0018-9448).

D.H. Smith, L.A. Hughes and S. Perkins, A New Table of Constant Weight Codes of Length Greater than 28, The Electronic Journal of Combinatorics, Vol. 13, No. 1, (May 2006), #A2. (ISSN: 1077-8926) (Print version: The Journal of Combinatorics, ISSN: 1097-1440).

D.H. Smith, L.A. Hughes, J.N.J. Moon and R. Montemanni, Measuring the Effectiveness of Frequency Assignment Algorithms, IEEE Transaction on Vehicular Technology, Vol. 56, No. 1, (Jan. 2007), pp. 331-341. (ISSN 0018-9545).

R. Montemanni, D.H. Smith and L.M. Gambardella, Ant Colony Systems for Large Sequential Ordering Problems, CDROM: “Proceedings of the 2007 IEEE Swarm Intelligence Symposium (SIS 2007)”. (ISBN: 1-4244-0708-7).

D.H. Smith, S. Perkins, Cyclically permutable representations of cyclic codes,
Discrete Applied Mathematics, Vol. 156, (2008), pp. 76-81. (ISSN 0166-218X).
doi: 10.1016/j.dam.2007.08.038.

S.K. Jones, P.A. Roach and S. Perkins. Construction of Heuristics for a Search-Based Approach to Solving SuDoku. Research and Development in Intelligent Systems XXIV: Proceedings of AI-2007, the Twenty-seventh SGAI International Conference on Artificial Intelligence, (Springer-Verlag, Bramer, M., Coenen, F., and Petridis, M. Eds), (2007) pp37-49. (ISBN 978-1-84800-093-3.)

S. K. Jones, S. Perkins and P.A. Roach, Properties of Sudoku Puzzles, Proceedings of the 2nd Research Student Workshop, University of Glamorgan, 2007. (ISBN 978-1-84054-179-3)

R. Montemanni, D.H. Smith and L.M. Gambardella, A heuristic manipulation technique for the sequential ordering problem, Computers & Operations Research , Vol. 35 (2008) pp. 3931 – 3944 (ISSN: 0305-0548) doi:10.1016/j.cor.2007.05.003

J. S. Graham, R. Montemanni, J.N.J. Moon and D.H. Smith, Frequency assignment, multiple interference and binary constraints,” Wireless Networks 14:4 August 2008 (ISSN: 1022-0038) doi: 10.1007/s11276-006-0730-x

R. Montemanni, A.E. Rizzoli, D.H. Smith, L.M. Gambardella, Sequential Ordering Problems for Crane Scheduling in Port Terminals, Proceeding of the 11th Intermodal Workshop on Harbor, Maritime & Multimodal Logistic Modeling & Simulation (HMS), International Mediterranean and Latin American Modeling Multiconference (I3M), Bruzzone et al. eds., pages 180-189, September 17-19 2008, Campora San Giovanni, Italy. (ISBN 978-88-903724-2-1).

R. Montemanni and D.H. Smith, Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm, J. Math. Modelling and Algorithms, Vol. 7 (2008) pp. 311-326
(ISSN: 1570-1166) doi 10.1007/s10852-008-9087-8

P.A. Roach, I.J. Grimstead, S.K. Jones and S. Perkins, A Knowledge-Rich Approach to the Rapid Enumeration of Quasi-Magic Sudoku Search Spaces. Proceedings of ICAART 2009, the 1st International Conference on Agents and Artificial Intelligence, Porto, Portugal, 19-21 January 2009, (INSTICC Press, Filipe, J., Fred, A. and Sharp, B. Eds.).246-254

D.H. Smith, R.P. Ward and S. Perkins, Gold codes, Hadamard partitions and the security of CDMA systems, Designs, Codes and Cryptography, Vol. 51 (2009), pp. 231-243 (ISSN 0925-1022) doi: 10.1007/s10623-008-9257-8

M.B.J. Higgs, S. Perkins, D.H. Smith, The construction of variable length codes with good synchronization properties, IEEE Transactions on Information Theory, Vol. 55, No. 4, (April 2009), pp. 1696-1700 (ISSN: 0018-9448) doi: 10.1109/TIT.2009.2013050

R. Montemanni and D.H. Smith, Heuristic manipulation, tabu search and frequency assignment, Computers & Operations Research, Vol. 37 (2010), pp. 543-551 (ISSN: 0305 0548) doi: 10.1016/j.cor.2008.08.006

R. Montemanni and D.H. Smith, Heuristic algorithms for constructing binary constant weight codes, IEEE Transactions on Information Theory, Vol. 55, No. 10, (October 2009), pp. 4651 -4656 (ISSN: 0018-9448) doi: 10.1109/TIT.2009.2027491

R. Montemanni, D.H. Smith, A.E. Rizzoli and L.M. Gambardella, Sequential ordering problems for crane scheduling in port terminals, International Journal of Simulation and Process Modelling, Vol. 5, No. 4, (2009), pp. 348-361 (ISSN 1740-2123) doi:10.1504/IJSPM.2009.032597

R.P. Davies, S. Perkins and P. Roach, The use of problem domain information in the automated solution of Kakuro puzzles, International Journal of Computer Science 37 (2010) pp. 118-127

S.O. Sanusi, D.H. Smith, R.A. Jones and S. Perkins, The application of frequency assignment techniques in spreading code assignment, Wireless Personal Communications, Vol. 54, No. 3, (2010), pp. 397-415 (ISSN 0929-6212)
doi: 10.1007/s11277-009-9732-1

D. Williams, S.K. Jones, P. A. Roach, and S. Perkins, Blocking Intercalates In Sudoku Erasure Correcting Codes, International Journal of Computer Science (IJCS), Vol. 38, No. 3, (2011), pp. 183-191.

D.H. Smith, F.H. Hunt and S. Perkins, Exploiting spatial separations in CDMA systems with correlation constrained sets of Hadamard matrices, IEEE Transactions on Information Theory, Vol. 56, No. 11, (November 2010), pp. 5757-5761 (ISSN: 0018-9448) doi: 10.1109/TIT.2010.2070310

D.H. Smith, N. Aboluion, R. Montemanni and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content, Discrete Mathematics, Vol. 311, (2011), pp. 1207-1219 (ISSN: 0012-365X) doi: 10.1016/j.disc.2010.03.005

S.K. Jones, S. Perkins and P.A. Roach, Properties, Isomorphisms and enumeration of 2-quasi-magic Sudoku grids. Discrete Mathematics, Vol. 311, (2011), pp. 1098-1110 (ISSN: 0012-365X) doi:10.1016/j.disc.2010.09.026

L.A. Phillips, S. Perkins, P.A. Roach and D.H. Smith, Sudoku puzzles as erasure correcting codes, Journal of Recreational Mathematics, Vol. 36, No. 2 (volume date 2007), (published 2011) pp. 83-88. (ISSN 0022-412X).

S. K. Jones, S. Perkins and P.A Roach, The Structure of Reduced Sudoku Grids and the Sudoku Symmetry Group, International Journal of Combinatorics, vol. 2012, Article ID 760310, 6 pages, 2012. doi:10.1155/2012/760310.

D.H. Smith and R. Montemanni, A new table of permutation codes, Designs, Codes and Cryptography, Vol. 63, No. 2, (May 2012), pp. 241-253, (ISSN 0925-1022) doi: 10.1007/s10623-011-9551-8

N. Aboluion, D.H. Smith and S. Perkins, Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint, Discrete Mathematics, Vol. 312, (2012), pp. 1062-1075 (ISSN: 0012-365X) doi:10.1016/j.disc.2011.11.021

D.H. Smith and R. Montemanni, Permutation codes with specified packing radius, Designs, Codes and Cryptography, October 2013, Volume 69, Issue 1, pp 95-106, (ISSN 0925-1022)
doi: 10.1007/s10623-012-9623-4

R. Montemanni, M. Salani, D.H. Smith, and F. Hunt. A variable neighbourhood search heuristic for the design of codes, Proceedings of the 8th International Conference on Computing and Information Technology (IC2IT 2012), 9-10 May 2012, Pattaya City, Thailand , pp 127-132. ISBN 978-616-7701-01-1

F.H. Hunt and D.H. Smith, The Construction of Orthogonal Variable Spreading Factor Codes from Semi-Bent Functions, IEEE Transactions on Wireless Communications, Vol. 11,No. 8, (2012) pp. 2970-2975 (ISSN 1536-1276 ) doi: 10.1109/TWC.2012.062012.111928

Derek H. Smith and Roberto Montemanni, Some constant weight codes from primitive permutation groups, The Electronic Journal of Combinatorics, 19(4), (2012), #P4 (ISSN: 1077-8926)

L.H. Harris, S. Perkins, P. A. Roach and S.K. Jones, Bishop Independence. British Journal of Mathematics & Computer Science, 2013, 3(4): 835-843.

F. H. Hunt and D. H. Smith, The Assignment of CDMA Spreading Codes Constructed from Hadamard Matrices and Almost Bent Functions, Wireless Personal Communications, Vol. 72(4) (October 2013), pp. 2215-2227
doi: 10.1007/s11277-013-1144-6 Print ISSN 0929-6212 Online ISSN 1572-834X

F. H. Hunt, S. Perkins and D. H. Smith, Decoding mixed errors and erasures in permutation codes, Designs, Codes and Cryptography, Vol. 74(2) (January 2015) pp. 481-493.
doi: 10.1007/s10623-013-9872-x ISSN: 0925-1022 (Print) 1573-7586 (Online)

D. Tulpan, D.H. Smith and R. Montemanni, Thermodynamic post-processing versus GC-content pre-processing for DNA codes satisfying the Hamming distance and reverse-complement constraints, IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 11, No. 2, March/April 2014, pp. 441-452. doi:10.1109/TCBB.2014.2299815 ISSN: 1545-5963

J. Barta, R. Montemanni and D.H. Smith, A branch and bound approach to permutation codes, 2nd International Conference on Information and Communication Technology (ICoICT), 2014, Bandung, Indonesia, pp187-192. IEEE catalog number: CFP14ICZ-DVD, ISBN: 978-1-4799-3580-2

R. Montemanni, J. Barta, and D.H. Smith, Permutation codes: a branch and bound approach, ADVANCES in APPLIED and PURE MATHEMATICS, Proceedings of the 2014 International Conference on Pure Mathematics, Applied Mathematics, Computational Methods (PMAMCM 2014), Santorini Island, Greece,
July 17-21, 2014, pp.86-90. ISSN: 2227-4588 ISBN: 978-1-61804-240-8

R. Montemanni, D.H. Smith, and N. Koul, Three metaheuristics for the construction of constant GC-content DNA codes, in: Proceedings of the 6th International Conference on Applied Operational Research, Vancouver, Canada, July 2014, Lecture Notes in Management Science (2014) Vol. 6: 167–175 ISSN 2008-0050 (Print), ISSN 1927-0097 (Online) http://www.tadbir.ca/lnms/archive/v6.htm

R. Montemanni, J. Barta, and D.H. Smith, Permutation codes: a new upper bound for M(7,5), Proceedings of the 2014 International Conference on Informatics and Advanced Computing (ICIAC), T. Yingthawornsuk and O. Adiguzel eds., International Academy of Engineers (IA-E), pages 1-3, 2014
ISBN: 978-93-84468-12-5.

J. Barta, R. Montemanni and D.H. Smith, Permutation Codes via Fragmentation of Group Orbits, 3rd International Conference on Information and Communication Technology (ICoICT), 2015, Bali, Indonesia, pp. 38-43. IEEE catalog number: CFP15ICZ-DVD, ISBN: 978-1-4799-7751-2

Francis H. Hunt, Stephanie Perkins and Derek H. Smith, Channel models and error correction codes for DNA information storage, Int. J. Information and Coding Theory, Vol. 3, No. 2, 2015, pp. 120-136. DOI: 10.1504/IJICOT.2015.072619
ISSN 1753-7703(print), 1753-7711 (online).
http://www.inderscience.com/offer.php?id=72619

Derek H. Smith, Developing frequency assignment techniques for British military communication systems, in: UK Success Stories in Industrial Mathematics (eds. P.J. Aston. A.J. Mulholland, K.M.M. Tant) pp. 171-177, Springer International Publishing Switzerland 2016 ISBN 978-3-319-25452-4, ISBN 978-3-319-25454-8 (eBook), DOI 10.1007/978-3-319-25454-8
(eBook), DOI 10.1007/978-3-319-25454-8

Roberto Montemanni, Janos Barta, Derek H. Smith, Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms, in: New Advances in Information Systems and Technologies, Part I, pp 223-232, Springer International Publishing Switzerland 2016, ISBN 978-3-319-31231-6 (print), ISBN 978-3-319-31232-3 (online), DOI 10.1007/978-3-319-31232-3_21

Janos Barta, Roberto Montemanni and Derek H. Smith, Packing regularity of permutation codes, Proc. ICAOR 2016, Rotterdam, The Netherlands, Lecture Notes in Management Science (2016) Vol. 8, 86–92, ISSN 2008-0050 (Print), ISSN 1927-0097 (Online)