Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. - Matthew Geoffrey Parker (AAECC, 1999)

Optimal sequences for channel estimation using discrete Fourier transform techniques. - Chintha Tellambura; Matthew Geoffrey Parker; Y. Jay Guo; Simon J. Shepherd; Stephen K. Barton (IEEE Trans. Commun., 1999)

Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. - Matthew Geoffrey Parker (AAECC, 2001)

Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement. - Matthew Geoffrey Parker (IMACC, 2001)

The Quantum Entanglement of Binary and Bipolar Sequences. - Matthew Geoffrey Parker; Vincent Rijmen (SETA, 2001)

Quantum factor graphs. - Matthew Geoffrey Parker (Ann. des Télécommunications, 2001)

Generalised Rudin-Shapiro Constructions. - Matthew Geoffrey Parker; Chintha Tellambura (Electron. Notes Discret. Math., 2001)

Logarithm cartesian authentication codes. - T. W. Sze; Samuel T. Chanson; Cunsheng Ding; Tor Helleseth; Matthew Geoffrey Parker (Inf. Comput., 2003)

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform. - Lars Eirik Danielsen; Matthew Geoffrey Parker (SETA, 2004)

Univariate and Multivariate Merit Factors. - Matthew Geoffrey Parker (SETA, 2004)

Binary sequences with merit factor ge6.3. - Raymond A. Kristiansen; Matthew Geoffrey Parker (IEEE Trans. Inf. Theory, 2004)

The multivariate merit factor of a Boolean function. - T. Aaron Gulliver; Matthew Geoffrey Parker (ITW, 2005)

One and Two-Variable Interlace Polynomials: A Spectral Interpretation. - Constanza Riera; Matthew Geoffrey Parker (WCC, 2005)

Generalised Bent Criteria for Boolean Functions (I) - Constanza Riera; Matthew Geoffrey Parker (CoRR, 2005)

Generalised Bent Criteria for Boolean Functions (II) - Constanza Riera; George Petrides; Matthew Geoffrey Parker (CoRR, 2005)

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform - Lars Eirik Danielsen; Matthew Geoffrey Parker (CoRR, 2005)

Aperiodic propagation criteria for Boolean functions. - Lars Eirik Danielsen; T. Aaron Gulliver; Matthew Geoffrey Parker (Inf. Comput., 2006)

On the classification of all self-dual additive codes over GF(4) of length up to 12. - Lars Eirik Danielsen; Matthew Geoffrey Parker (J. Comb. Theory A, 2006)

Generalized Bent Criteria for Boolean Functions (I). - Constanza Riera; Matthew Geoffrey Parker (IEEE Trans. Inf. Theory, 2006)

On Boolean Functions Which Are Bent and Negabent. - Matthew Geoffrey Parker; Alexander Pott (SSC, 2007)

There are no Barker arrays having more than two dimensions. - Jonathan Jedwab; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2007)

Golay complementary array pairs. - Jonathan Jedwab; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2007)

Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. - Joakim Grahl Knudsen; Constanza Riera; Matthew Geoffrey Parker; Eirik Rosnes (ICMCTA, 2008)

Close Encounters with Boolean Functions of Three Different Kinds. - Matthew Geoffrey Parker (ICMCTA, 2008)

Negabent Functions in the Maiorana-McFarland Class. - Kai-Uwe Schmidt; Matthew Geoffrey Parker; Alexander Pott (SETA, 2008)

Edge local complementation and equivalence of binary linear codes. - Lars Eirik Danielsen; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2008)

From graph states to two-graph states. - Constanza Riera; Stéphane Jacob; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2008)

A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. - Frank Fiedler; Jonathan Jedwab; Matthew Geoffrey Parker (J. Comb. Theory A, 2008)

A Framework for the Construction ofGolay Sequences. - Frank Fiedler; Jonathan Jedwab; Matthew Geoffrey Parker (IEEE Trans. Inf. Theory, 2008)

The Rayleigh Quotient of Bent Functions. - Lars Eirik Danielsen; Matthew Geoffrey Parker; Patrick Solé (IMACC, 2009)

Iterative decoding on multiple tanner graphs using random edge local complementation. - Joakim Grahl Knudsen; Constanza Riera; Lars Eirik Danielsen; Matthew Geoffrey Parker; Eirik Rosnes (ISIT, 2009)

Two binary sequence families with large merit factor. - Kai-Uwe Schmidt; Jonathan Jedwab; Matthew Geoffrey Parker (Adv. Math. Commun., 2009)

Equivalence Between Certain Complementary Pairs of Types I and III. - Tor E. Bjørstad; Matthew Geoffrey Parker (Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009)

Improved adaptive belief propagation decoding using edge-local complementation. - Joakim Grahl Knudsen; Constanza Riera; Lars Eirik Danielsen; Matthew Geoffrey Parker; Eirik Rosnes (ISIT, 2010)

Boolean functions whose restrictions are highly nonlinear. - Constanza Riera; Matthew Geoffrey Parker (ITW, 2010)

Interlace polynomials: Enumeration, unimodality and connections to codes. - Lars Eirik Danielsen; Matthew Geoffrey Parker (Discret. Appl. Math., 2010)

Self-dual bent functions. - Claude Carlet; Lars Eirik Danielsen; Matthew Geoffrey Parker; Patrick Solé (Int. J. Inf. Coding Theory, 2010)

Generalised Complementary Arrays. - Matthew Geoffrey Parker; Constanza Riera (IMACC, 2011)

Complementary arrays - New directions. - Matthew Geoffrey Parker (IWSDA, 2011)

Extended Binary Linear Codes from Legendre Sequences. - T. Aaron Gulliver; Matthew Geoffrey Parker (Ars Comb., 2011)

Directed graph representation of half-rate additive codes over GF(4). - Lars Eirik Danielsen; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2011)

Editorial. - Matthew Geoffrey Parker; Sasha Kholosha; Pascale Charpin; Eirik Rosnes (Des. Codes Cryptogr., 2011)

Complementary Sequence Pairs of Types II and III. - Chunlei Li 001; Nian Li; Matthew Geoffrey Parker (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

Random Edge-Local Complementation with Applications to Iterative Decoding of High-Density Parity-Check Codes. - Joakim Grahl Knudsen; Constanza Riera; Lars Eirik Danielsen; Matthew Geoffrey Parker; Eirik Rosnes (IEEE Trans. Commun., 2012)

Device-independent quantum key distribution based on Hardy's paradox. - Ramij Rahaman; Matthew Geoffrey Parker; Piotr Mironowicz; Marcin Pawlowski 002 (CoRR, 2013)

The selfnegadual properties of generalised quadratic Boolean functions. - Lars Eirik Danielsen; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2013)

A complementary construction using mutually unbiased bases. - Gaofei Wu; Matthew Geoffrey Parker (Cryptogr. Commun., 2014)

Quantum secret sharing based on local distinguishability. - Ramij Rahaman; Matthew Geoffrey Parker (CoRR, 2014)

Editorial: special issue on coding and cryptography. - Lilya Budaghyan; Tor Helleseth; Matthew Geoffrey Parker (Des. Codes Cryptogr., 2014)

On the PMEPR of Binary Golay Sequences of Length $2^{n}$. - Zilong Wang 001; Matthew Geoffrey Parker; Guang Gong; Gaofei Wu (IEEE Trans. Inf. Theory, 2014)

Neural network associative memories with local coding. - Asieh Abolpour Mofrad; Zahra Ferdosi; Matthew Geoffrey Parker; Mohammad Hesam Tadayon (CWIT, 2015)

On graphs and codes preserved by edge local complementation. - Lars Eirik Danielsen; Matthew Geoffrey Parker; Constanza Riera; Joakim Grahl Knudsen (Des. Codes Cryptogr., 2015)

Clique-Based Neural Associative Memories with Local Coding and Precoding. - Asieh Abolpour Mofrad; Matthew Geoffrey Parker; Zahra Ferdosi; Mohammad Hesam Tadayon (Neural Comput., 2016)

Nested-Clique Network Model of Neural Associative Memory. - Asieh Abolpour Mofrad; Matthew Geoffrey Parker (Neural Comput., 2017)

Editorial: Special Issue on Mathematical Methods for Cryptography. - Lilya Budaghyan; Chunlei Li 001; Matthew Geoffrey Parker (Cryptogr. Commun., 2019)

On Boolean functions with several flat spectra. - Gaofei Wu; Matthew Geoffrey Parker (Cryptogr. Commun., 2019)

Root-Hadamard transforms and complementary sequences. - Luis A. Medina; Matthew Geoffrey Parker; Constanza Riera; Pantelimon Stanica (Cryptogr. Commun., 2020)

Polyphase zero correlation zone sequences from generalised bent functions. - Dan Zhang 013; Matthew Geoffrey Parker; Tor Helleseth (Cryptogr. Commun., 2020)

On Neural Associative Memory Structures: Storage and Retrieval of Sequences in a Chain of Tournaments. - Asieh Abolpour Mofrad; Samaneh Abolpour Mofrad; Anis Yazidi; Matthew Geoffrey Parker (Neural Comput., 2021)

Quantum states associated to mixed graphs and their algebraic characterization. - Constanza Riera; Matthew Geoffrey Parker; Pantelimon Stanica (Adv. Math. Commun., 2023)