Matthew Geoffrey Parker

70 papers B 4C 9Journal 48Unranked 8
YearRankTypeTitle / Venue / Authors
2023 J jnl
Quantum states associated to mixed graphs and their algebraic characterization.
Adv. Math. Commun.
Constanza Riera, Matthew Geoffrey Parker, Pantelimon Stanica
2021 J jnl
On Neural Associative Memory Structures: Storage and Retrieval of Sequences in a Chain of Tournaments.
Neural Comput.
Asieh Abolpour Mofrad, Samaneh Abolpour Mofrad, Anis Yazidi, Matthew Geoffrey Parker
2020 J jnl
Polyphase zero correlation zone sequences from generalised bent functions.
Cryptogr. Commun.
Dan Zhang, Matthew Geoffrey Parker, Tor Helleseth
2020 J jnl
Root-Hadamard transforms and complementary sequences.
Cryptogr. Commun.
Luis A. Medina, Matthew Geoffrey Parker, Constanza Riera, Pantelimon Stanica
2019 J jnl
Editorial: Special Issue on Mathematical Methods for Cryptography.
Cryptogr. Commun.
Lilya Budaghyan, Chunlei Li, Matthew Geoffrey Parker
2019 J jnl
On Boolean functions with several flat spectra.
Cryptogr. Commun.
Gaofei Wu, Matthew Geoffrey Parker
2019 J jnl
Root-Hadamard transforms and complementary sequences.
CoRR
Luis A. Medina, Matthew Geoffrey Parker, Constanza Riera, Pantelimon Stanica
2017 J jnl
Nested-Clique Network Model of Neural Associative Memory.
Neural Comput.
Asieh Abolpour Mofrad, Matthew Geoffrey Parker
2016 J jnl
Clique-Based Neural Associative Memories with Local Coding and Precoding.
Neural Comput.
Asieh Abolpour Mofrad, Matthew Geoffrey Parker, Zahra Ferdosi, Mohammad Hesam Tadayon
2015 — conf
Neural network associative memories with local coding.
CWIT
Asieh Abolpour Mofrad, Zahra Ferdosi, Matthew Geoffrey Parker, Mohammad Hesam Tadayon
2015 J jnl
On graphs and codes preserved by edge local complementation.
Des. Codes Cryptogr.
Lars Eirik Danielsen, Matthew Geoffrey Parker, Constanza Riera, Joakim Grahl Knudsen
2014 J jnl
A complementary construction using mutually unbiased bases.
Cryptogr. Commun.
Gaofei Wu, Matthew Geoffrey Parker
2014 J jnl
Editorial: special issue on coding and cryptography.
Des. Codes Cryptogr.
Lilya Budaghyan, Tor Helleseth, Matthew Geoffrey Parker
2014 J jnl
On the PMEPR of Binary Golay Sequences of Length $2^{n}$.
IEEE Trans. Inf. Theory
Zilong Wang, Matthew Geoffrey Parker, Guang Gong, Gaofei Wu
2014 J jnl
Quantum secret sharing based on local distinguishability.
CoRR
Ramij Rahaman, Matthew Geoffrey Parker
2013 J jnl
A complementary construction using mutually unbiased bases.
CoRR
Gaofei Wu, Matthew Geoffrey Parker
2013 J jnl
Device-independent quantum key distribution based on Hardy's paradox.
CoRR
Ramij Rahaman, Matthew Geoffrey Parker, Piotr Mironowicz, Marcin Pawlowski
2013 J jnl
The selfnegadual properties of generalised quadratic Boolean functions.
Des. Codes Cryptogr.
Lars Eirik Danielsen, Matthew Geoffrey Parker
2012 J jnl
Complementary Sequence Pairs of Types II and III.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chunlei Li, Nian Li, Matthew Geoffrey Parker
2012 J jnl
Random Edge-Local Complementation with Applications to Iterative Decoding of High-Density Parity-Check Codes.
IEEE Trans. Commun.
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes
2011 — conf
Complementary arrays - New directions.
IWSDA
Matthew Geoffrey Parker
2011 J jnl
Directed graph representation of half-rate additive codes over GF(4).
Des. Codes Cryptogr.
Lars Eirik Danielsen, Matthew Geoffrey Parker
2011 J jnl
Editorial.
Des. Codes Cryptogr.
Matthew Geoffrey Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes
2011 J jnl
Extended Binary Linear Codes from Legendre Sequences.
Ars Comb.
T. Aaron Gulliver, Matthew Geoffrey Parker
2011 C conf
Generalised Complementary Arrays.
IMACC
Matthew Geoffrey Parker, Constanza Riera
2010 B conf
Boolean functions whose restrictions are highly nonlinear.
ITW
Constanza Riera, Matthew Geoffrey Parker
2010 B conf
Improved adaptive belief propagation decoding using edge-local complementation.
ISIT
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes
2010 J jnl
Interlace polynomials: Enumeration, unimodality and connections to codes.
Discret. Appl. Math.
Lars Eirik Danielsen, Matthew Geoffrey Parker
2010 J jnl
On Graphs and Codes Preserved by Edge Local Complementation
CoRR
Lars Eirik Danielsen, Matthew Geoffrey Parker, Constanza Riera, Joakim Grahl Knudsen
2010 J jnl
Self-dual bent functions.
Int. J. Inf. Coding Theory
Claude Carlet, Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé
2009 C ed.
Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings
IMACC
Matthew Geoffrey Parker
2009 J jnl
Directed Graph Representation of Half-Rate Additive Codes over GF(4)
CoRR
Lars Eirik Danielsen, Matthew Geoffrey Parker
2009 — ch.
Equivalence Between Certain Complementary Pairs of Types I and III.
Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes
Tor E. Bjørstad, Matthew Geoffrey Parker
2009 J jnl
Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation
CoRR
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes
2009 B conf
Iterative decoding on multiple tanner graphs using random edge local complementation.
ISIT
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes
2009 C conf
The Rayleigh Quotient of Bent Functions.
IMACC
Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé
2009 J jnl
Two binary sequence families with large merit factor.
Adv. Math. Commun.
Kai-Uwe Schmidt, Jonathan Jedwab, Matthew Geoffrey Parker
2008 J jnl
A Framework for the Construction ofGolay Sequences.
IEEE Trans. Inf. Theory
Frank Fiedler, Jonathan Jedwab, Matthew Geoffrey Parker
2008 J jnl
A multi-dimensional approach to the construction and enumeration of Golay complementary sequences.
J. Comb. Theory A
Frank Fiedler, Jonathan Jedwab, Matthew Geoffrey Parker
2008 — conf
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation.
ICMCTA
Joakim Grahl Knudsen, Constanza Riera, Matthew Geoffrey Parker, Eirik Rosnes
2008 — conf
Close Encounters with Boolean Functions of Three Different Kinds.
ICMCTA
Matthew Geoffrey Parker
2008 J jnl
Edge local complementation and equivalence of binary linear codes.
Des. Codes Cryptogr.
Lars Eirik Danielsen, Matthew Geoffrey Parker
2008 J jnl
From graph states to two-graph states.
Des. Codes Cryptogr.
Constanza Riera, Stéphane Jacob, Matthew Geoffrey Parker
2008 J jnl
Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes.
CoRR
Lars Eirik Danielsen, Matthew Geoffrey Parker
2008 C conf
Negabent Functions in the Maiorana-McFarland Class.
SETA
Kai-Uwe Schmidt, Matthew Geoffrey Parker, Alexander Pott
2008 C ed.
Sequences and Their Applications - SETA 2008, 5th International Conference, Lexington, KY, USA, September 14-18, 2008, Proceedings
SETA
Solomon W. Golomb, Matthew Geoffrey Parker, Alexander Pott, Arne Winterhof
2007 J jnl
Edge Local Complementation and Equivalence of Binary Linear Codes
CoRR
Lars Eirik Danielsen, Matthew Geoffrey Parker
2007 J jnl
Golay complementary array pairs.
Des. Codes Cryptogr.
Jonathan Jedwab, Matthew Geoffrey Parker
2007 — conf
On Boolean Functions Which Are Bent and Negabent.
SSC
Matthew Geoffrey Parker, Alexander Pott
2007 J jnl
There are no Barker arrays having more than two dimensions.
Des. Codes Cryptogr.
Jonathan Jedwab, Matthew Geoffrey Parker
2006 J jnl
Aperiodic propagation criteria for Boolean functions.
Inf. Comput.
Lars Eirik Danielsen, T. Aaron Gulliver, Matthew Geoffrey Parker
2006 J jnl
Generalized Bent Criteria for Boolean Functions (I).
IEEE Trans. Inf. Theory
Constanza Riera, Matthew Geoffrey Parker
2006 J jnl
On the classification of all self-dual additive codes over GF(4) of length up to 12.
J. Comb. Theory A
Lars Eirik Danielsen, Matthew Geoffrey Parker
2005 J jnl
Generalised Bent Criteria for Boolean Functions (I)
CoRR
Constanza Riera, Matthew Geoffrey Parker
2005 J jnl
Generalised Bent Criteria for Boolean Functions (II)
CoRR
Constanza Riera, George Petrides, Matthew Geoffrey Parker
2005 J jnl
On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12.
CoRR
Lars Eirik Danielsen, Matthew Geoffrey Parker
2005 — conf
One and Two-Variable Interlace Polynomials: A Spectral Interpretation.
WCC
Constanza Riera, Matthew Geoffrey Parker
2005 J jnl
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform
CoRR
Lars Eirik Danielsen, Matthew Geoffrey Parker
2005 B conf
The multivariate merit factor of a Boolean function.
ITW
T. Aaron Gulliver, Matthew Geoffrey Parker
2004 J jnl
Binary sequences with merit factor ge6.3.
IEEE Trans. Inf. Theory
Raymond A. Kristiansen, Matthew Geoffrey Parker
2004 C conf
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}
SETA
Lars Eirik Danielsen, Matthew Geoffrey Parker
2004 C conf
Univariate and Multivariate Merit Factors.
SETA
Matthew Geoffrey Parker
2003 J jnl
Logarithm cartesian authentication codes.
Inf. Comput.
T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew Geoffrey Parker
2001 — conf
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation.
AAECC
Matthew Geoffrey Parker
2001 J jnl
Generalised Rudin-Shapiro Constructions.
Electron. Notes Discret. Math.
Matthew Geoffrey Parker, Chintha Tellambura
2001 J jnl
Quantum factor graphs.
Ann. des Télécommunications
Matthew Geoffrey Parker
2001 C conf
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement.
IMACC
Matthew Geoffrey Parker
2001 C conf
The Quantum Entanglement of Binary and Bipolar Sequences.
SETA
Matthew Geoffrey Parker, Vincent Rijmen
1999 — conf
Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels.
AAECC
Matthew Geoffrey Parker
1999 J jnl
Optimal sequences for channel estimation using discrete Fourier transform techniques.
IEEE Trans. Commun.
Chintha Tellambura, Matthew Geoffrey Parker, Y. Jay Guo, Simon J. Shepherd, Stephen K. Barton