Matthew G. Parker

According to our database1, Matthew G. Parker authored at least 57 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Root-Hadamard transforms and complementary sequences.
CoRR, 2019

On Boolean functions with several flat spectra.
Cryptography and Communications, 2019

Editorial: Special Issue on Mathematical Methods for Cryptography.
Cryptography and Communications, 2019

2017
Nested-Clique Network Model of Neural Associative Memory.
Neural Computation, 2017

2016
Clique-Based Neural Associative Memories with Local Coding and Precoding.
Neural Computation, 2016

2015
On graphs and codes preserved by edge local complementation.
Des. Codes Cryptogr., 2015

Neural network associative memories with local coding.
Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2014
On the PMEPR of Binary Golay Sequences of Length $2^{n}$.
IEEE Trans. Information Theory, 2014

Editorial: special issue on coding and cryptography.
Des. Codes Cryptogr., 2014

Quantum secret sharing based on local distinguishability.
CoRR, 2014

A complementary construction using mutually unbiased bases.
Cryptography and Communications, 2014

2013
The selfnegadual properties of generalised quadratic Boolean functions.
Des. Codes Cryptogr., 2013

Device-independent quantum key distribution based on Hardy's paradox.
CoRR, 2013

2012
Random Edge-Local Complementation with Applications to Iterative Decoding of High-Density Parity-Check Codes.
IEEE Trans. Communications, 2012

Complementary Sequence Pairs of Types II and III.
IEICE Transactions, 2012

2011
Editorial.
Des. Codes Cryptogr., 2011

Directed graph representation of half-rate additive codes over GF(4).
Des. Codes Cryptogr., 2011

Extended Binary Linear Codes from Legendre Sequences.
Ars Comb., 2011

Complementary arrays - New directions.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

Generalised Complementary Arrays.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011

2010
Self-dual bent functions.
IJICoT, 2010

Interlace polynomials: Enumeration, unimodality and connections to codes.
Discret. Appl. Math., 2010

Boolean functions whose restrictions are highly nonlinear.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Improved adaptive belief propagation decoding using edge-local complementation.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Equivalence Between Certain Complementary Pairs of Types I and III.
Proceedings of the Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, 2009

Two binary sequence families with large merit factor.
Adv. in Math. of Comm., 2009

Iterative decoding on multiple tanner graphs using random edge local complementation.
Proceedings of the IEEE International Symposium on Information Theory, 2009

The Rayleigh Quotient of Bent Functions.
Proceedings of the Cryptography and Coding, 2009

2008
A Framework for the Construction ofGolay Sequences.
IEEE Trans. Information Theory, 2008

A multi-dimensional approach to the construction and enumeration of Golay complementary sequences.
J. Comb. Theory, Ser. A, 2008

From graph states to two-graph states.
Des. Codes Cryptogr., 2008

Edge local complementation and equivalence of binary linear codes.
Des. Codes Cryptogr., 2008

Negabent Functions in the Maiorana-McFarland Class.
Proceedings of the Sequences and Their Applications, 2008

Close Encounters with Boolean Functions of Three Different Kinds.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007
Golay complementary array pairs.
Des. Codes Cryptogr., 2007

There are no Barker arrays having more than two dimensions.
Des. Codes Cryptogr., 2007

On Boolean Functions Which Are Bent and Negabent.
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007

2006
Generalized Bent Criteria for Boolean Functions (I).
IEEE Trans. Information Theory, 2006

On the classification of all self-dual additive codes over GF(4) of length up to 12.
J. Comb. Theory, Ser. A, 2006

Aperiodic propagation criteria for Boolean functions.
Inf. Comput., 2006

2005
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform
CoRR, 2005

Generalised Bent Criteria for Boolean Functions (II)
CoRR, 2005

Generalised Bent Criteria for Boolean Functions (I)
CoRR, 2005

One and Two-Variable Interlace Polynomials: A Spectral Interpretation.
Proceedings of the Coding and Cryptography, International Workshop, 2005

The multivariate merit factor of a Boolean function.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

2004
Binary sequences with merit factor ge6.3.
IEEE Trans. Information Theory, 2004

Univariate and Multivariate Merit Factors.
Proceedings of the Sequences and Their Applications, 2004

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform.
Proceedings of the Sequences and Their Applications, 2004

2003
Logarithm cartesian authentication codes.
Inf. Comput., 2003

2001
Generalised Rudin-Shapiro Constructions.
Electron. Notes Discret. Math., 2001

Quantum factor graphs.
Annales des Télécommunications, 2001

The Quantum Entanglement of Binary and Bipolar Sequences.
Proceedings of the Sequences and their Applications, 2001

Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement.
Proceedings of the Cryptography and Coding, 2001

Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation.
Proceedings of the Applied Algebra, 2001

1999
Optimal sequences for channel estimation using discrete Fourier transform techniques.
IEEE Trans. Communications, 1999

Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels.
Proceedings of the Applied Algebra, 1999


  Loading...