Search the dblp DataBase

Publications of Author

1. Matthew G. Parker
   Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. [Citation Graph (0, 0)][DBLP]
   AAECC, 2001, pp:200-209 [Conf]
   
2. Matthew G. Parker
   Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. [Citation Graph (0, 0)][DBLP]
   AAECC, 1999, pp:420-429 [Conf]
   
3. Matthew G. Parker
   Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement. [Citation Graph (0, 0)][DBLP]
   IMA Int. Conf., 2001, pp:339-354 [Conf]
   
4. Lars Eirik Danielsen, Matthew G. Parker
   Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}ⁿ Transform. [Citation Graph (0, 0)][DBLP]
   SETA, 2004, pp:373-388 [Conf]
   
5. Matthew G. Parker
   Univariate and Multivariate Merit Factors. [Citation Graph (0, 0)][DBLP]
   SETA, 2004, pp:72-100 [Conf]
   
6. Constanza Riera, Matthew G. Parker
   One and Two-Variable Interlace Polynomials: A Spectral Interpretation. [Citation Graph (0, 0)][DBLP]
   WCC, 2005, pp:397-411 [Conf]
   
7. T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew G. Parker
   Logarithm cartesian authentication codes. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2003, v:184, n:1, pp:93-108 [Journal]
   
8. Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker
   Aperiodic propagation criteria for Boolean functions. [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 2006, v:204, n:5, pp:741-770 [Journal]
   
9. Lars Eirik Danielsen, Matthew G. Parker
   On the classification of all self-dual additive codes over GF(4) of length up to 12. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 2006, v:113, n:7, pp:1351-1367 [Journal]
   
10. Raymond A. Kristiansen, Matthew G. Parker
    Binary sequences with merit factor ge6.3. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3385-3389 [Journal]
    
11. Constanza Riera, Matthew G. Parker
    Generalised Bent Criteria for Boolean Functions (I) [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
    
12. Constanza Riera, George Petrides, Matthew G. Parker
    Generalised Bent Criteria for Boolean Functions (II) [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
    
13. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
    
14. Lars Eirik Danielsen, Matthew G. Parker
    Edge Local Complementation and Equivalence of Binary Linear Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
15. Jonathan Jedwab, Matthew G. Parker
    There are no Barker arrays having more than two dimensions. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:43, n:2-3, pp:79-84 [Journal]
    
16. Jonathan Jedwab, Matthew G. Parker
    Golay complementary array pairs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:209-216 [Journal]
    
17. 
    The Rayleigh Quotient of Bent Functions. [Citation Graph (, )][DBLP]
    
    
18. 
    Negabent Functions in the Maiorana-McFarland Class. [Citation Graph (, )][DBLP]
    
    
19. 
    On Boolean Functions Which Are Bent and Negabent. [Citation Graph (, )][DBLP]
    
    
20. 
    Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. [Citation Graph (, )][DBLP]
    
    
21. 
    Close Encounters with Boolean Functions of Three Different Kinds. [Citation Graph (, )][DBLP]
    
    
22. 
    Directed Graph Representation of Half-Rate Additive Codes over GF(4) [Citation Graph (, )][DBLP]
    
    
23. 
    Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation [Citation Graph (, )][DBLP]
    
    
24. 
    On Graphs and Codes Preserved by Edge Local Complementation [Citation Graph (, )][DBLP]
    
    
25. 
    Interlace polynomials: Enumeration, unimodality and connections to codes. [Citation Graph (, )][DBLP]
    
    
26. 
    From graph states to two-graph states. [Citation Graph (, )][DBLP]
    
    
27. 
    Edge local complementation and equivalence of binary linear codes. [Citation Graph (, )][DBLP]