# Staff Directory

## Dr Stephanie Perkins

#### Contact Details

- Faculty of Computing, Engineering and Science
- Head of Mathematics
- stephanie.perkins@southwales.ac.uk
- (01443) 4 82289
- J417
- Treforest

## Qualifications

BSc PhD FIMA CMath

## About

**Career Summary, Specialist Projects and Academic Activities;**

I joined the University of South Wales (formerly University of Glamorgan) as a research fellow in 1994 after completing my PhD in Coding Theory at Royal Holloway, University of London. In 1999, I became a Lecturer, in 2005 a Principal Lecturer and in 2014 Head of Mathematics. I was included in the Computing submission for the 2001 and 2007 Research Assessment Exercises and the Mathematics submission in the most recent REF. During my time at this University I have successfully jointly supervised eight research students to the award of PhD and MPhil, and am currently supervising two research students,

I undertake research with other academics and industrial collaborators and details of publications can be seen below.

## Responsibilities

**Main Teaching subjects and Course Leadership:**

Head of Mathematics.

Subject Leader Mathematics,

Subject Leader Service Mathematics

Algebra

Combinatorics

Codes and information

Cryptography

## Publications

**Selected Publications:**

Derek H. Smith, Stephanie Perkins, Roberto Montemanni, Solving the maximum clique problem with a hybrid algorithm, Int. J. Metaheuristics, Vol. 7, No. 2, 2019, pp. 152-175. ISSN online 1755-2184, ISSN print 1755-2176.

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.

**Editorial Work**

K.J. Edwards, J. van den Heuvel, S. Perkins, B. Webb and V. Zverovich, Discrete Mathematics, Selected Papers from the 23rd British Combinatorial Conference, Volume 313, Issue 11, 2013, Page 1131-1280, ISSN 0012-365X,

Keith Edwards, Jan van den Heuvel, Stephanie Perkins, John Talbot, Bridget Webb and Vadim Zverovich, Discrete Mathematics, Selected Papers from the 22nd British Combinatorial Conference, Volume 311, Issue 13, Pages 1073-1254 ( July 2011)

K. J. Edwards, T. S. Griggs, J. van den Heuvel, S. Perkins, B. S. Webb and V. Zverovich. Discrete Mathematics “Special Issue 21st British Combinatorial Conference” Vol. 310, No..2, 2010..

F.K Bell, K.J. Edwards, T.S. Griggs, S. Perkins and J van den Heuvel, Discrete Mathematics “Special Issue 20th British Combinatorial Conference”Vol. 308, No.5-6, pp. 619-998, 2008.

D.R. Woodall, F.K Bell, K.J. Edwards, T.S. Griggs, S. Perkins, Discrete Mathematics “Special Issue 19th British Combinatorial Conference” Vol. 293, No.1-3, 2005. ISSN 0012-365X.

## Memberships

Fellow, Institute of Mathematics and its Applications.

## Research

**Main Research Subjects & Current Projects:**

Coding Theory

Combinatorics including applications to Recreational Maths problems

Synchronization of Variable Length Codes.

Robust Data Compression Strategies.

**If you are a journalist on deadline and you need to speak with** a member of university staff with particular expertise, please contact the Press Office.