Matthew Geoffrey Parker's picture
Matthew Geoffrey
Parker
Professor
Visit Address: 
HIB - Thormøhlensgt. 55
5020 Bergen
Postal Address: 
Postboks 7803
5020 Bergen
Phone: 
+47 55 58 41 92
Download vCard
Books
  • Budaghyan, Lilya; Helleseth, Tor; Parker, Matthew Geoffrey. 2013. Preproceedings, The International Workshop on Coding and Cryptography WCC 2013. Universitetet i Bergen. 576 pages. ISBN: 978-82-308-2269-2.
  • Parker, Matthew Geoffrey; Riera, Constanza. 2010. Boolean functions whose restrictions are highly nonlinear. 500 pages. ISBN: 978-1-4244-8264-1.
  • Kholosa, Alexander; Rosnes, Eirik; Parker, Matthew Geoffrey. 2009. Preproceedings The International Workshop on Coding and Cryptography. 550 pages. ISBN: 978-82-92610-09-1.
Journal articles
  • Wang, Zilong; Parker, Matthew Geoffrey; Gong, Guang; Wu, Gaofei. 2014. On the PMEPR of binary golay sequences of length 2n. IEEE Transactions on Information Theory. 60: 2391-2398. doi: 10.1109/TIT.2014.2300867
  • Wu, Gaofei; Parker, Matthew Geoffrey. 2014. A complementary construction using mutually unbiased bases. Cryptography and Communications. 6: 3-25. doi: 10.1007/s12095-013-0095-9
  • Cabello, Adán; Parker, Matthew Geoffrey; Scarpa, Giannicola; Severini, Simone. 2013. Exclusivity structures and graph representatives of local complementation orbits. Journal of Mathematical Physics. 54. 18 pages. doi: 10.1063/1.4813438
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey. 2013. The selfnegadual properties of generalised quadratic Boolean functions. Designs, Codes and Cryptography. 66: 305-316. doi: 10.1007/s10623-012-9693-3
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Riera, Constanza Susana; Knudsen, Joakim Grahl. 2013. On graphs and codes preserved by edge local complementation. Designs, Codes and Cryptography. doi: 10.1007/s10623-013-9876-6
  • Knudsen, Joakim Grahl; Riera, Constanza; Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Rosnes, Eirik. 2012. Random edge-local complementation with applications to iterative decoding of high-density parity-check codes. IEEE Transactions on Communications. 60: 2796-2808. doi: 10.1109/TCOMM.2012.081012.110406
  • Li, Chunlei; Li, Nian; Parker, Matthew Geoffrey. 2012. Complementary sequence pairs of types II and III. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. E95A: 1819-1826. doi: 10.1587/transfun.E95.A.1819
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey. 2011. Directed graph representation of half-rate additive codes over GF(4). Designs, Codes and Cryptography. 59: 119-130. doi: 10.1007/s10623-010-9469-6
  • Gulliver, T. Aaron; Parker, Matthew Geoffrey. 2011. Doubly-even binary linear codes from Legendre sequences. Ars combinatoria. 100: 435-447.
  • Gulliver, T. Aaron; Parker, Matthew Geoffrey. 2011. Extended Binary Linear Codes from Legendre Sequences. Ars combinatoria. 100: 435-447.
  • Parker, Matthew Geoffrey; Kholosa, Alexander; Charpin, Pascale; Rosnes, Eirik. 2011. Special Issue: Coding and Cryptography. Designs, Codes and Cryptography. 59: 1-1. doi: 10.1007/s10623-010-9473-x
  • Parker, Matthew Geoffrey; Riera, Constanza. 2011. Generalised complementary arrays. Lecture Notes in Computer Science. 7089. doi: 10.1007/978-3-642-25516-8_4
  • Carlet, Claude; Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Solé, Patrick. 2010. Self-dual bent functions. International Journal of Information and Coding Theory. 1: 384-399. doi: 10.1504/IJICOT.2010.032864
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey. 2010. Interlace polynomials: Enumeration, unimodality and connections to codes. Discrete Applied Mathematics. 158: 636-648. doi: 10.1016/j.dam.2009.11.011
  • Knudsen, Joakim Grahl; Riera, Constanza; Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Rosnes, Eirik. 2010. Improved adaptive belief propagation decoding using edge-local complementation. IEEE International Symposium on Information Theory. Proceedings. 774-778. doi: 10.1109/ISIT.2010.5513625
  • Bjørstad, Tor Erling; Parker, Matthew Geoffrey. 2009. Equivalence Between Certain Complementary Pairs of Types I and III. NATO Science for Peace and Security Series - D: Information and Communication Security. 23.
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Solé, Patrick. 2009. The Rayleigh Quotient of Bent Functions. Lecture Notes in Computer Science. 5921: 418-432. doi: 10.1007/978-3-642-10868-6_25
  • Jedwab, Jonathan; Parker, Matthew Geoffrey. 2009. A Construction of Binary Golay Sequence Pairs from odd-Length Barker Sequences. Journal of combinatorial designs (Print). 17: 478-491. doi: 10.1002/jcd.20222
  • Schmidt, Kai Uwe; Jedwab, Jonathan; Parker, Matthew Geoffrey. 2009. Two binary sequence families with large merit factor. Advances in Mathematics of Communications. 3: 135-156. doi: 10.3934/amc.2009.3.135
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey. 2008. Edge local complementation and equivalence of binary linear codes. Designs, Codes and Cryptography. 49: 161-170. doi: 10.1007/s10623-008-9190-x
  • Fiedler, Frank; Jedwab, Jonathan; Parker, Matthew Geoffrey. 2008. A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. Journal of combinatorial theory. Series A (Print). 115: 753-776. doi: 10.1016/j.jcta.2007.10.001
  • Fiedler, Frank; Jedwab, Jonathan; Parker, Matthew Geoffrey. 2008. A framework for the construction of Golay sequences. IEEE Transactions on Information Theory. 54: 3114-3129. doi: 10.1109/TIT.2008.924667
  • Knudsen, Joakim Grahl; Riera, Constanza Susana; Parker, Matthew Geoffrey; Rosnes, Eirik. 2008. Adaptive Soft-Decision Decoding Using Edge Local Complementation. Lecture Notes in Computer Science. 5228: 82-94. doi: 10.1007/978-3-540-87448-5_10
  • Knudsen, Joakim Grahl; Riera, Constanza Susana; Parker, Matthew Geoffrey; Rosnes, Eirik. 2008. Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. Lecture Notes in Computer Science. 5228: 82-94.
  • Parker, Matthew Geoffrey. 2008. Close encounters with Boolean functions of three different kinds. Lecture Notes in Computer Science. 5228: 137-153. doi: 10.1007/978-3-540-87448-5_15
  • Riera, Constanza Susana; Jacob, Stéphane; Parker, Matthew Geoffrey. 2008. From graph states to two-graph states. Designs, Codes and Cryptography. 48: 179-206. doi: 10.1007/s10623-008-9167-9
  • Schmidt, Kai Uwe; Parker, Matthew Geoffrey; Pott, Alexander. 2008. Negabent Functions in the Maiorana-McFarland Class. Lecture Notes in Computer Science. 5203: 390-402. doi: 10.1007/978-3-540-85912-3_34
  • Jedwab, Jonathan; Parker, Matthew Geoffrey. 2007. There are no Barker arrays having more than two. dimensions. Designs, Codes and Cryptography. 43: 79-84. doi: 10.1007/s10623-007-9060-y
  • Jedwab, Jonathan; Parker, Matthew Geoffrey. 2007. Golay complementary array pairs. Designs, Codes and Cryptography. 44: 209-216. doi: 10.1007/s10623-007-9088-z
  • Parker, Matthew Geoffrey; Pott, Alexander. 2007. On Boolean functions which are bent and negabent. Lecture Notes in Computer Science. 4893: 9-23.
  • Danielsen, Lars Erik; Gulliver, T. Aaron; Parker, Matthew Geoffrey. 2006. Aperiodic propagation criteria for Boolean functions. Information and Computation. 204: 741-770. doi: 10.1016/j.ic.2006.01.004
  • Danielsen, Lars Erik; Parker, Matthew Geoffrey. 2006. On the classification of all self-dual additive codes over GF(4) of length up to 12. Journal of combinatorial theory. Series A (Print). 113: 1351-1367.
  • Riera, Constanza Susana; Parker, Matthew Geoffrey. 2006. One and two-variable interlace polynomials: A spectral interpretation. Lecture Notes in Computer Science. 3969: 397-411. doi: 10.1007/11779360
  • Riera, Constanza Susana; Parker, Matthew Geoffrey. 2006. Generalized bent criteria for Boolean functions (I). IEEE Transactions on Information Theory. 52: 4142-4159. doi: 10.1109/TIT.2006.880069
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey. 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. 3486: 373-388.
  • Parker, Matthew Geoffrey. 2005. Univariate and multivariate merit factors. Lecture Notes in Computer Science. 3486: 72-100.
  • Kristiansen, RA; Parker, Matthew Geoffrey. 2004. Binary Sequences with Merit Factor > 6.3. IEEE Transactions on Information Theory. 50: 3385-3389. doi: 10.1109/TIT.2004.838343
  • Helleseth, Tor; Parker, Matthew Geoffrey. 2003. Logarithm Cartesian Authentication Codes. Information and Computation. 184: 93-108. Published 2003-07-10.
  • Lahooti, H.; White, R.; Danielian, P. S.; Parker, Matthew Geoffrey. 1994. Characterization of ligand-dependent phosphorylation of the estrogen receptor. Molecular Endocrinology. 8: 182-188.
Reports and theses
  • Knudsen, Joakim Grahl; Riera, Constanza; Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Rosnes, Eirik. 2010. Random Edge-Local Complementation With Applications to Iterative Decoding of HDPC Codes. Reports in Informatics. 395. Department of Informatics, University of Bergen, Bergen, Norway. 52 pages.
Book sections
  • Knudsen, Joakim Grahl; Riera, Constanza; Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Rosnes, Eirik. 2010. Improved adaptive belief propagation decoding using edge-local complementation. paper, pages 774-778. In:
    • Gastpar, Michael; Heath, Robert W.; Narayanan, Krishna. 2010. Proceedings of 2010 International Symposium on Information Theory : Trondheim June 21-23, 2010. IEEE Signal Processing Society. 2722 pages. ISBN: 978-1-4244-6960-4.
  • Knudsen, Joakim Grahl; Riera, Constanza; Danielsen, Lars Eirik; Parker, Matthew Geoffrey; Rosnes, Eirik. 2009. Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation. paper, pages 899-903. In:
    • Calderbank, Robert; Chung, Habong; Orlitsky, Alon. 2009. 2009 IEEE International Symposium on Information Theory. IEEE Press. 2896 pages. ISBN: 978-1-4244-4313-0.
  • Hassanzadeh, Mehdi; Salehani, Y. E.; Abyaneh, M.R.S.; Parker, Matthew Geoffrey; Helleseth, Tor. 2008. Differential distinguishing attack on the Shannon stream cipher based on fault analysis. Kapitel, pages 671-676. In:
    • Kamarei, Mahmoud. 2008. Proceedings of International Symposium of Telecommunications (IST 2008). IEEE Communications Society. 1000 pages. ISBN: 1424427509.
  • Danielsen, Lars Eirik; Parker, Matthew Geoffrey. 2005. On the classification of all self-dual additive codes over GF(4) of length up to 12. Kapittel, pages 47-52. In:
    • Dodunekov, Stefan. 2005. Proceedings Optimal Codes and Related Topics. 303 pages. ISBN: 954-8986-18-3.
  • Gulliver, T. Aaron; Parker, Matthew Geoffrey. 2005. The multivariate merit factor of a boolean function. Kapittel, pages 58-62. In:
    • Dinneen, Michael j. 2005. Proceedings of the 2005 IEEE Information Theory Workshop on Coding and Complexity. IEEE Press. 281 pages. ISBN: 078039481X.
  • Riera, Constanza Susana; Parker, Matthew Geoffrey. 2005. On pivot orbits of boolean functions. Kapittel, pages 248-253. In:
    • Dodunekov, Stefan. 2005. Proceedings Optimal Codes and Related Topics. 303 pages. ISBN: 954-8986-18-3.
  • Schmidt, Kai Uwe; Parker, Matthew Geoffrey; Pott, Alexander. 2001. Negabent Functions in the Maiorana–McFarland Class. -, pages 390-402. In:
    • Helleseth, Tor; Kumar, Vijay; Yang, Kyeongcheol. 2001. Sequences and their applications-SETA'01 : Proceedings of SETA'01. Springer. ISBN: 1-85233-529-7.

More information in national current research information system (CRIStin)