Matthew G. Parker

	2011
41		Matthew G. Parker, Constanza Riera: Generalised Complementary Arrays. IMA Int. Conf. 2011: 41-60
40		Matthew G. Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes: Editorial. Des. Codes Cryptography 59(1-3): 1 (2011)
39		Lars Eirik Danielsen, Matthew G. Parker: Directed graph representation of half-rate additive codes over GF(4). Des. Codes Cryptography 59(1-3): 119-130 (2011)
	2010
38		Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, Eirik Rosnes: Improved adaptive belief propagation decoding using edge-local complementation. ISIT 2010: 774-778
37		Lars Eirik Danielsen, Matthew G. Parker, Constanza Riera, Joakim Grahl Knudsen: On Graphs and Codes Preserved by Edge Local Complementation CoRR abs/1006.5802: (2010)
36		Lars Eirik Danielsen, Matthew G. Parker: Interlace polynomials: Enumeration, unimodality and connections to codes. Discrete Applied Mathematics 158(6): 636-648 (2010)
35		Claude Carlet, Lars Eirik Danielsen, Matthew G. Parker, Patrick Solé: Self-dual bent functions. IJICoT 1(4): 384-399 (2010)
	2009
34		Matthew G. Parker: Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings Springer 2009
33		Lars Eirik Danielsen, Matthew G. Parker, Patrick Solé: The Rayleigh Quotient of Bent Functions. IMA Int. Conf. 2009: 418-432
32		Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, Eirik Rosnes: Iterative decoding on multiple tanner graphs using random edge local complementation. ISIT 2009: 899-903
31		Lars Eirik Danielsen, Matthew G. Parker: Directed Graph Representation of Half-Rate Additive Codes over GF(4) CoRR abs/0902.3883: (2009)
30		Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, Eirik Rosnes: Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation CoRR abs/0905.4164: (2009)
	2008
29		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
28		Matthew G. Parker: Close Encounters with Boolean Functions of Three Different Kinds. ICMCTA 2008: 137-153
27		Joakim Grahl Knudsen, Constanza Riera, Matthew G. Parker, Eirik Rosnes: Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. ICMCTA 2008: 82-94
26		Kai-Uwe Schmidt, Matthew G. Parker, Alexander Pott: Negabent Functions in the Maiorana-McFarland Class. SETA 2008: 390-402
25		Constanza Riera, Stéphane Jacob, Matthew G. Parker: From graph states to two-graph states. Des. Codes Cryptography 48(2): 179-206 (2008)
24		Lars Eirik Danielsen, Matthew G. Parker: Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptography 49(1-3): 161-170 (2008)
23		Frank Fiedler, Jonathan Jedwab, Matthew G. Parker: A Framework for the Construction ofGolay Sequences. IEEE Transactions on Information Theory 54(7): 3114-3129 (2008)
22		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
21		Matthew G. Parker, Alexander Pott: On Boolean Functions Which Are Bent and Negabent. SSC 2007: 9-23
20		Lars Eirik Danielsen, Matthew G. Parker: Edge Local Complementation and Equivalence of Binary Linear Codes CoRR abs/0710.2243: (2007)
19		Jonathan Jedwab, Matthew G. Parker: There are no Barker arrays having more than two dimensions. Des. Codes Cryptography 43(2-3): 79-84 (2007)
18		Jonathan Jedwab, Matthew G. Parker: Golay complementary array pairs. Des. Codes Cryptography 44(1-3): 209-216 (2007)
	2006
17		Constanza Riera, Matthew G. Parker: Generalized Bent Criteria for Boolean Functions (I). IEEE Transactions on Information Theory 52(9): 4142-4159 (2006)
16		Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker: Aperiodic propagation criteria for Boolean functions. Inf. Comput. 204(5): 741-770 (2006)
15		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
14		Constanza Riera, Matthew G. Parker: One and Two-Variable Interlace Polynomials: A Spectral Interpretation. WCC 2005: 397-411
13		Constanza Riera, Matthew G. Parker: Generalised Bent Criteria for Boolean Functions (I) CoRR abs/cs/0502049: (2005)
12		Constanza Riera, George Petrides, Matthew G. Parker: Generalised Bent Criteria for Boolean Functions (II) CoRR abs/cs/0502050: (2005)
11		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
10		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
9		Matthew G. Parker: Univariate and Multivariate Merit Factors. SETA 2004: 72-100
8		Raymond A. Kristiansen, Matthew G. Parker: Binary sequences with merit factor ge6.3. IEEE Transactions on Information Theory 50(12): 3385-3389 (2004)
	2003
7		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
6		Matthew G. Parker: Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. AAECC 2001: 200-209
5		Matthew G. Parker: Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement. IMA Int. Conf. 2001: 339-354
4		Matthew G. Parker: Quantum factor graphs. Annales des Télécommunications 56(7-8): 472-483 (2001)
3		Matthew G. Parker, Chintha Tellambura: Generalised Rudin-Shapiro Constructions. Electronic Notes in Discrete Mathematics 6: 364-374 (2001)
	1999
2		Matthew G. Parker: Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. AAECC 1999: 420-429
1		Chintha Tellambura, Matthew G. Parker, Y. J. Guo, S. J. Shepherd, S. K. Barton: Optimal sequences for channel estimation using discrete Fourier transform techniques. IEEE Transactions on Communications 47(2): 230-238 (1999)

Coauthor Index

1	S. K. Barton	[1]
2	Claude Carlet	[35]
3	Samuel T. Chanson	[7]
4	Pascale Charpin	[40]
5	Lars Eirik Danielsen	[10] [11] [15] [16] [20] [24] [30] [31] [32] [33] [35] [36] [37] [38] [39]
6	Cunsheng Ding	[7]
7	Frank Fiedler	[22] [23]
8	Solomon W. Golomb	[29]
9	T. Aaron Gulliver	[16]
10	Y. J. Guo	[1]
11	Tor Helleseth	[7]
12	Stéphane Jacob	[25]
13	Jonathan Jedwab	[18] [19] [22] [23]
14	Sasha Kholosha	[40]
15	Joakim Grahl Knudsen	[27] [30] [32] [37] [38]
16	Raymond A. Kristiansen	[8]
17	George Petrides	[12]
18	Alexander Pott	[21] [26] [29]
19	Constanza Riera	[12] [13] [14] [17] [25] [27] [30] [32] [37] [38] [41]
20	Eirik Rosnes	[27] [30] [32] [38] [40]
21	Kai-Uwe Schmidt	[26]
22	S. J. Shepherd	[1]
23	Patrick Solé	[33] [35]
24	T. W. Sze	[7]
25	Chintha Tellambura (Chinthananda Tellambura)	[1] [3]
26	Arne Winterhof	[29]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page