Hjem
Matthew Geoffrey Parkers bilde

Matthew Geoffrey Parker

Professor
  • E-postmatthew@uib.no
  • Telefon+47 55 58 41 92+47 991 54 376
  • Besøksadresse
    HIB - Thormøhlensgt. 55
  • Postadresse
    Postboks 7803
    5020 Bergen
Vitenskapelig artikkel
  • 2020. Root-Hadamard transforms and complementary sequences. Cryptography and Communications. 1035-1049.
  • 2019. Special Issue on Mathematical Methods for Cryptography. Cryptography and Communications. 363-365.
  • 2019. Polyphase Zero Correlation Zone Sequences from Generalised Bent Functions. Cryptography and Communications.
  • 2019. On Boolean functions with several flat spectra. Cryptography and Communications. 853-880.
  • 2016. Message Passing Decoding for self-dual F4-additive codes. Norsk Informasjonssikkerhetskonferanse (NISK). 2-6.
  • 2016. Clique-based neural associative memories with local coding and precoding. Neural Computation. 1553-1573.
  • 2015. Quantum scheme for secret sharing based on local distinguishability. Physical Review A. Atomic, Molecular, and Optical Physics (PRA).
  • 2015. On graphs and codes preserved by edge local complementation. Designs, Codes and Cryptography. 601-621.
  • 2015. Device-independent quantum key distribution based on measurement inputs. Physical Review A. Atomic, Molecular, and Optical Physics (PRA).
  • 2014. On the PMEPR of binary golay sequences of length 2n. IEEE Transactions on Information Theory. 2391-2398.
  • 2014. A complementary construction using mutually unbiased bases. Cryptography and Communications. 3-25.
  • 2013. The selfnegadual properties of generalised quadratic Boolean functions. Designs, Codes and Cryptography. 305-316.
  • 2013. Exclusivity structures and graph representatives of local complementation orbits. Journal of Mathematical Physics. 18 sider.
  • 2012. Random edge-local complementation with applications to iterative decoding of high-density parity-check codes. IEEE Transactions on Communications. 2796-2808.
  • 2012. Complementary sequence pairs of types II and III. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 1819-1826.
  • 2011. Generalised complementary arrays. Lecture Notes in Computer Science (LNCS).
  • 2011. Extended Binary Linear Codes from Legendre Sequences. Ars combinatoria. 435-447.
  • 2011. Doubly-even binary linear codes from Legendre sequences. Ars combinatoria. 435-447.
  • 2011. Directed graph representation of half-rate additive codes over GF(4). Designs, Codes and Cryptography. 119-130.
  • 2010. Self-dual bent functions. International Journal of Information and Coding Theory. 384-399.
  • 2010. Interlace polynomials: Enumeration, unimodality and connections to codes. Discrete Applied Mathematics. 636-648.
  • 2010. Improved adaptive belief propagation decoding using edge-local complementation. IEEE International Symposium on Information Theory. Proceedings. 774-778.
  • 2009. Two binary sequence families with large merit factor. Advances in Mathematics of Communications. 135-156.
  • 2009. The Rayleigh Quotient of Bent Functions. Lecture Notes in Computer Science (LNCS). 418-432.
  • 2009. Equivalence Between Certain Complementary Pairs of Types I and III. NATO Science for Peace and Security Series - D: Information and Communication Security.
  • 2009. A Construction of Binary Golay Sequence Pairs from odd-Length Barker Sequences. Journal of combinatorial designs (Print). 478-491.
  • 2008. Negabent Functions in the Maiorana-McFarland Class. Lecture Notes in Computer Science (LNCS). 390-402.
  • 2008. From graph states to two-graph states. Designs, Codes and Cryptography. 179-206.
  • 2008. Edge local complementation and equivalence of binary linear codes. Designs, Codes and Cryptography. 161-170.
  • 2008. Close encounters with Boolean functions of three different kinds. Lecture Notes in Computer Science (LNCS). 137-153.
  • 2008. Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. Lecture Notes in Computer Science (LNCS). 82-94.
  • 2008. Adaptive Soft-Decision Decoding Using Edge Local Complementation. Lecture Notes in Computer Science (LNCS). 82-94.
  • 2008. A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. Journal of combinatorial theory. Series A. 753-776.
  • 2008. A framework for the construction of Golay sequences. IEEE Transactions on Information Theory. 3114-3129.
  • 2007. There are no Barker arrays having more than two. dimensions. Designs, Codes and Cryptography. 79-84.
  • 2007. On Boolean functions which are bent and negabent. Lecture Notes in Computer Science (LNCS). 9-23.
  • 2007. Golay complementary array pairs. Designs, Codes and Cryptography. 209-216.
  • 2006. One and two-variable interlace polynomials: A spectral interpretation. Lecture Notes in Computer Science (LNCS). 397-411.
  • 2006. On the classification of all self-dual additive codes over GF(4) of length up to 12. Journal of combinatorial theory. Series A. 1351-1367.
  • 2006. Generalized bent criteria for Boolean functions (I). IEEE Transactions on Information Theory. 4142-4159.
  • 2006. Aperiodic propagation criteria for Boolean functions. Information and Computation. 741-770.
  • 2005. Univariate and multivariate merit factors. Lecture Notes in Computer Science (LNCS). 72-100.
  • 2005. Spectral orbits and peak-to-average power ratio of Boolean functions with respect to the {I,H,N}^n transform. Lecture Notes in Computer Science (LNCS). 373-388.
  • 2004. Binary Sequences with Merit Factor > 6.3. IEEE Transactions on Information Theory. 3385-3389.
  • 2003. Logarithm Cartesian Authentication Codes. Information and Computation. 93-108.
  • 1994. Characterization of ligand-dependent phosphorylation of the estrogen receptor. Molecular Endocrinology. 182-188.
Rapport
  • 2010. Random Edge-Local Complementation With Applications to Iterative Decoding of HDPC Codes. 395. 395. .
Vitenskapelig foredrag
  • 2015. Neural network associative memories with local coding.
  • 2011. The selfnegadual properties of generalised quadratic Boolean functions.
  • 2011. Generalised Complementary Arrays.
  • 2010. On iterative decoding of HDPC codes using weight-bounding graph operations.
  • 2010. On graphs preserved by edge local complementation.
  • 2009. The Rayleigh quotient of bent functions.
  • 2009. Directed graph representation of half-rate additive codes over GF(4).
  • 2008. Self Dual Bent Functions.
  • 2008. Aperiodic properties of Boolean functions.
  • 2007. Edge local complementation and equivalence of binary linear codes.
  • 2005. Graph equivalence from equivalent quantum states.
  • 2004. Spectral orbits and peak-to-average power ratio of Boolean functions with respect to the {I,H,N}^n transform.
  • 2004. Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n transform.
Leder
  • 2014. Editorial: Special issue on coding and cryptography. Designs, Codes and Cryptography. 269.
  • 2011. Special Issue: Coding and Cryptography. Designs, Codes and Cryptography. 1-1.
Vitenskapelig antologi/Konferanseserie
  • 2013. Preproceedings, The International Workshop on Coding and Cryptography WCC 2013. Universitetet i Bergen.
  • 2010. Boolean functions whose restrictions are highly nonlinear. IEEE.
  • 2009. Preproceedings The International Workshop on Coding and Cryptography. Allkopi Bergen.
Mastergradsoppgave
  • 2005. On Self-Dual Quantum Codes, Graphs, and Boolean Functions.
Brev til redaktøren
  • 2017. Nested-clique networkmodel of neural associativememory. Neural Computation. 1681-1695.
Doktorgradsavhandling
  • 2008. On Connections Between Graphs, Codes, Quantum States, and Boolean Functions.
Vitenskapelig Kapittel/Artikkel/Konferanseartikkel
  • 2015. Mixed graph states. 2 sider.
  • 2010. Improved adaptive belief propagation decoding using edge-local complementation. 5 sider.
  • 2009. Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation. 5 sider.
  • 2008. Differential distinguishing attack on the Shannon stream cipher based on fault analysis. 6 sider.
  • 2005. The multivariate merit factor of a boolean function. 5 sider.
  • 2005. On the classification of all self-dual additive codes over GF(4) of length up to 12. 6 sider.
  • 2005. On pivot orbits of boolean functions. 6 sider.
  • 2001. Negabent Functions in the Maiorana–McFarland Class. 13 sider.
Poster
  • 2015. Mixed graph states.

Se fullstendig oversikt over publikasjoner i CRIStin.