2009 |
27 | EE | Lars Eirik Danielsen,
Matthew G. Parker:
Directed Graph Representation of Half-Rate Additive Codes over GF(4)
CoRR abs/0902.3883: (2009) |
2008 |
26 | | Solomon W. Golomb,
Matthew G. Parker,
Alexander Pott,
Arne Winterhof:
Sequences and Their Applications - SETA 2008, 5th International Conference, Lexington, KY, USA, September 14-18, 2008, Proceedings
Springer 2008 |
25 | EE | Matthew G. Parker:
Close Encounters with Boolean Functions of Three Different Kinds.
ICMCTA 2008: 137-153 |
24 | EE | Joakim Grahl Knudsen,
Constanza Riera,
Matthew G. Parker,
Eirik Rosnes:
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation.
ICMCTA 2008: 82-94 |
23 | EE | Kai-Uwe Schmidt,
Matthew G. Parker,
Alexander Pott:
Negabent Functions in the Maiorana-McFarland Class.
SETA 2008: 390-402 |
22 | EE | Constanza Riera,
Stéphane Jacob,
Matthew G. Parker:
From graph states to two-graph states.
Des. Codes Cryptography 48(2): 179-206 (2008) |
21 | EE | Lars Eirik Danielsen,
Matthew G. Parker:
Edge local complementation and equivalence of binary linear codes.
Des. Codes Cryptography 49(1-3): 161-170 (2008) |
20 | EE | Frank Fiedler,
Jonathan Jedwab,
Matthew G. Parker:
A Framework for the Construction ofGolay Sequences.
IEEE Transactions on Information Theory 54(7): 3114-3129 (2008) |
19 | EE | Frank Fiedler,
Jonathan Jedwab,
Matthew G. Parker:
A multi-dimensional approach to the construction and enumeration of Golay complementary sequences.
J. Comb. Theory, Ser. A 115(5): 753-776 (2008) |
2007 |
18 | EE | Matthew G. Parker,
Alexander Pott:
On Boolean Functions Which Are Bent and Negabent.
SSC 2007: 9-23 |
17 | EE | Lars Eirik Danielsen,
Matthew G. Parker:
Edge Local Complementation and Equivalence of Binary Linear Codes
CoRR abs/0710.2243: (2007) |
16 | EE | Jonathan Jedwab,
Matthew G. Parker:
There are no Barker arrays having more than two dimensions.
Des. Codes Cryptography 43(2-3): 79-84 (2007) |
15 | EE | Jonathan Jedwab,
Matthew G. Parker:
Golay complementary array pairs.
Des. Codes Cryptography 44(1-3): 209-216 (2007) |
2006 |
14 | EE | Lars Eirik Danielsen,
T. Aaron Gulliver,
Matthew G. Parker:
Aperiodic propagation criteria for Boolean functions.
Inf. Comput. 204(5): 741-770 (2006) |
13 | EE | Lars Eirik Danielsen,
Matthew G. Parker:
On the classification of all self-dual additive codes over GF(4) of length up to 12.
J. Comb. Theory, Ser. A 113(7): 1351-1367 (2006) |
2005 |
12 | EE | Constanza Riera,
Matthew G. Parker:
One and Two-Variable Interlace Polynomials: A Spectral Interpretation.
WCC 2005: 397-411 |
11 | EE | Constanza Riera,
Matthew G. Parker:
Generalised Bent Criteria for Boolean Functions (I)
CoRR abs/cs/0502049: (2005) |
10 | EE | Constanza Riera,
George Petrides,
Matthew G. Parker:
Generalised Bent Criteria for Boolean Functions (II)
CoRR abs/cs/0502050: (2005) |
9 | EE | Lars Eirik Danielsen,
Matthew G. Parker:
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform
CoRR abs/cs/0504102: (2005) |
2004 |
8 | EE | Lars Eirik Danielsen,
Matthew G. Parker:
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform.
SETA 2004: 373-388 |
7 | EE | Matthew G. Parker:
Univariate and Multivariate Merit Factors.
SETA 2004: 72-100 |
6 | EE | Raymond A. Kristiansen,
Matthew G. Parker:
Binary sequences with merit factor ge6.3.
IEEE Transactions on Information Theory 50(12): 3385-3389 (2004) |
2003 |
5 | EE | T. W. Sze,
Samuel T. Chanson,
Cunsheng Ding,
Tor Helleseth,
Matthew G. Parker:
Logarithm cartesian authentication codes.
Inf. Comput. 184(1): 93-108 (2003) |
2001 |
4 | EE | Matthew G. Parker:
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation.
AAECC 2001: 200-209 |
3 | EE | Matthew G. Parker:
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement.
IMA Int. Conf. 2001: 339-354 |
2 | EE | Matthew G. Parker,
Chintha Tellambura:
Generalised Rudin-Shapiro Constructions.
Electronic Notes in Discrete Mathematics 6: 364-374 (2001) |
1999 |
1 | | Matthew G. Parker:
Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels.
AAECC 1999: 420-429 |