• Applicable Algebra in Engineering, Communication and Computing
• Bulletin of the Institute of Combinatorics and its Applications
• Designs, Codes and Cryptography
• IEEE Transactions on Information Theory

• (with Alena Ernst) Transitivity in finite general linear groups, arXiv:2209.07927 [math.GR]
• (with Tao Feng, Michael Kiermaier, Peixian Lin) Linear codes associated with the Desarguesian ovoids in Q+(7,q), arXiv:2208.12919 [math.CO]
• (with Alena Ernst) Intersection theorems for finite general linear groups, Math. Proc. Cambridge Philos. Soc. 175(1), 129-160, 2023.
• (with Charlene Weiß) Packings and Steiner systems in polar spaces, Combinatorial Theory 3(1), 2023.
• (with Charlene Weiß) Existence of small ordered orthogonal arrays, J. Combin. Des. 31(9), 422-431, 2023.
• Highly nonlinear functions over finite fields, Finite Fields Appl. 63, Article 101640, 2020.
• Quadratic and symmetric bilinear forms over finite fields and their association schemes, Algebraic Combin. 3(1), 161-189, 2020.
• (with D. Bartoli) Low-degree planar polynomials over finite fields of characteristic two, J. Algebra 535, 541-555, 2019.
• (with Ch. Günther) Sequence pairs with asymptotically optimal aperiodic correlation, IEEE Trans. Inform. Theory 65(8), 5233-5238, 2019.
• Asymptotically optimal Boolean functions, J. Combin. Theory Ser. A 164, 50-59, 2019.
• (with Y. Zhou) On the number of inequivalent Gabidulin codes, Des. Codes Cryptogr. 86(9) 1973-1982, 2018.
• Hermitian rank distance codes, Des. Codes Cryptogr. 86(7), 1469-1481, 2018.
• (with Ch. Günther) L^q norms of Fekete and related polynomials, Canad. J. Math. 69(4), 807-825, 2017.
• (with Ch. Günther) Merit factors of polynomials derived from difference sets, J. Combin. Theory Ser. A 145, 340-363, 2017.
• The correlation measures of finite sequences: limiting distributions and minimum values, Trans. Amer. Math. Soc. 369(1), 429-446, 2017.
• (with A. Pott and Y. Zhou) Pairs of quadratic forms over finite fields, Electron. J. Combin. 23(2), Paper #P2.8, 2016.
• Nonlinearity measures of random Boolean functions, Cryptogr. Commun. 8(4), 637-645, 2016.
• (with J. Willms) Barker sequences of odd length, Des. Codes Cryptogr. 80(2), 409-414, 2016.
• (with F. Caullery and Y. Zhou) Exceptional planar polynomials, Des. Codes Cryptogr. 78(3), 605-613, 2016.
• Sequences with small correlation, Des. Codes Cryptogr. 78(1), 237-267, 2016.
• (with F. Caullery) On the classification of hyperovals, Adv. Math. 283, 195-203, 2015.
• Symmetric bilinear forms over finite fields with applications to coding theory, J. Algebraic Combin. 42(2), 635-670, 2015.
• Highly nonlinear functions, Des. Codes Cryptogr. 74(3), 665-672, 2015.
• (with J. P. Bell, J. Jedwab and M. Khatirinejad) Three-phase Barker arrays, J. Combin. Des. 23(2), 45-59, 2015.
• (with Y. Zhou) Planar functions over fields of characteristic two, J. Algebraic Combin. 40(2), 503-526, 2014.
• (with A. Pott and Y. Zhou) Semifields, relative difference sets, and bent functions, Algebraic curves and finite fields, 161-178, Radon Ser. Comput. Appl. Math. 16, De Gruyter, 2014.
• The peak sidelobe level of random binary sequences, Bull. London Math. Soc. 46(3), 643-652, 2014.
• An extremal problem for polynomials, C. R. Math. Acad. Sci. Paris 352(2), 95-97, 2014.
• (with J. Jedwab and D. J. Katz) Littlewood polynomials with small L⁴ norm, Adv. Math. 241, 127-136, 2013.
• On a problem due to Littlewood concerning polynomials with unimodular coefficients, J. Fourier Anal. Appl. 19(3), 457-466, 2013.
• (with J. Jedwab and D. J. Katz) Advances in the merit factor problem for binary sequences, J. Combin. Theory Ser. A 120(4), 882-906, 2013.
• (with J. Jedwab) The L₄ norm of Littlewood polynomials derived from the Jacobi symbol, Pacific J. Math. 257(2), 395-418, 2012.
• On random binary sequences, Lecture Notes in Computer Science vol. 7280 (Sequences and Their Applications — Proceedings of SETA 2012), Springer-Verlag, pp. 303-314, 2012.
• Binary sequences with small peak sidelobe level, IEEE Trans. Inform. Theory 58(4), 2512-2515, April 2012.
• The merit factor of binary arrays derived from the quadratic character, Adv. Math. Commun. 5(4), 589-607, 2011.
• On the correlation distribution of Delsarte-Goethals sequences. Des. Codes Cryptogr. 59(1-3), 333-347, 2011.
• Sequence families with low correlation derived from multiplicative and additive characters. IEEE Trans. Inform. Theory 57(4), 2291-2294, 2011.
• Symmetric bilinear forms over finite fields of even characteristic. J. Combin. Theory Ser. A 117(8), 1011-1026, 2010.
• Bounds on the PMEPR of translates of binary codes. IEEE Commun. Lett. 14(11), 1059-1061, 2010.
• (with J. Jedwab) Appended m-sequences with merit factor greater than 3.34. Lecture Notes in Computer Science vol. 6338 (Sequences and Their Applications — Proceedings of SETA 2010), Springer-Verlag, pp. 204-216, 2010.
• (Awarded with the Best Paper Award of SETA 2010, given by Springer Verlag.)
• (with J. Jedwab) The merit factor of binary sequence families constructed from m-sequences. Contemp. Math. 518, 265-278, 2010.
• Z₄-Valued Quadratic Forms and Quaternary Sequence Families. IEEE Trans. Inform. Theory 55(12), 5803-5810, 2009.
• (with J. Jedwab and M. G. Parker) Two binary sequence families with large merit factor. Adv. Math. Commun. 3(2), 135-156, 2009.
• Quaternary Constant-Amplitude Codes for Multicode CDMA. IEEE Trans. Inform. Theory 55(4), 1824-1832, 2009.
• On the Peak-to-Mean Envelope Power Ratio of Phase-Shifted Binary Codes. IEEE Trans. Commun. 56(11), 1816-1823, 2008.
• (with M. G. Parker and A. Pott) Negabent Functions in the Maiorana-McFarland Class. Lecture Notes in Computer Science vol. 5203 (Sequences and Their Applications — Proceedings of SETA 2008), Springer-Verlag, pp. 390-402, 2008.
• Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM. IEEE Trans. Inform. Theory 53(2), 808-814, 2007.
• On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR. IEEE Trans. Inform. Theory 52(7), 3220-3232, 2006.
• (with A. Finger) Constructions of Complementary Sequences for Power-Controlled OFDM Transmission. Lecture Notes in Computer Science vol. 3969 (Coding and Cryptography — Revised Selected Papers of WCC 2005), pp. 330-345, 2006.
• (with A. Finger) Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes. IEEE Commun. Lett. 9(10), 912-914, 2005.

Tagungsbände

• K.-U. Schmidt, A. Winterhof, eds., Lecture Notes in Computer Science vol. 8865, Sequences and Their Applications — SETA 2014, Springer-Verlag, 2014.

Buchkapitel

• (with J. Jedwab) Finite fields in engineering, Handbook of Finite Fields, Ch. 17.3 (G. L. Mullen and D. Panario, eds.).