default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Geoffrey Parker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j35]Constanza Riera, Matthew Geoffrey Parker, Pantelimon Stanica:
Quantum states associated to mixed graphs and their algebraic characterization. Adv. Math. Commun. 17(3): 660-680 (2023)- 2021
- [j34]Asieh Abolpour Mofrad
, Samaneh Abolpour Mofrad, Anis Yazidi, Matthew Geoffrey Parker:
On Neural Associative Memory Structures: Storage and Retrieval of Sequences in a Chain of Tournaments. Neural Comput. 33(9): 2550-2577 (2021) - 2020
- [j33]Dan Zhang, Matthew Geoffrey Parker, Tor Helleseth:
Polyphase zero correlation zone sequences from generalised bent functions. Cryptogr. Commun. 12(3): 325-335 (2020) - [j32]Luis A. Medina, Matthew Geoffrey Parker, Constanza Riera, Pantelimon Stanica:
Root-Hadamard transforms and complementary sequences. Cryptogr. Commun. 12(5): 1035-1049 (2020)
2010 – 2019
- 2019
- [j31]Lilya Budaghyan, Chunlei Li, Matthew Geoffrey Parker:
Editorial: Special Issue on Mathematical Methods for Cryptography. Cryptogr. Commun. 11(3): 363-365 (2019) - [j30]Gaofei Wu, Matthew Geoffrey Parker:
On Boolean functions with several flat spectra. Cryptogr. Commun. 11(5): 853-880 (2019) - [i13]Luis A. Medina, Matthew Geoffrey Parker, Constanza Riera, Pantelimon Stanica:
Root-Hadamard transforms and complementary sequences. CoRR abs/1907.09360 (2019) - 2017
- [j29]Asieh Abolpour Mofrad, Matthew Geoffrey Parker:
Nested-Clique Network Model of Neural Associative Memory. Neural Comput. 29(6): 1681-1695 (2017) - 2016
- [j28]Asieh Abolpour Mofrad, Matthew Geoffrey Parker, Zahra Ferdosi, Mohammad Hesam Tadayon:
Clique-Based Neural Associative Memories with Local Coding and Precoding. Neural Comput. 28(8): 1553-1573 (2016) - 2015
- [j27]Lars Eirik Danielsen, Matthew Geoffrey Parker, Constanza Riera, Joakim Grahl Knudsen:
On graphs and codes preserved by edge local complementation. Des. Codes Cryptogr. 74(3): 601-621 (2015) - [c19]Asieh Abolpour Mofrad, Zahra Ferdosi, Matthew Geoffrey Parker, Mohammad Hesam Tadayon:
Neural network associative memories with local coding. CWIT 2015: 178-181 - 2014
- [j26]Gaofei Wu, Matthew Geoffrey Parker:
A complementary construction using mutually unbiased bases. Cryptogr. Commun. 6(1): 3-25 (2014) - [j25]Lilya Budaghyan, Tor Helleseth, Matthew Geoffrey Parker:
Editorial: special issue on coding and cryptography. Des. Codes Cryptogr. 73(2): 269 (2014) - [j24]Zilong Wang, Matthew Geoffrey Parker, Guang Gong, Gaofei Wu:
On the PMEPR of Binary Golay Sequences of Length $2^{n}$. IEEE Trans. Inf. Theory 60(4): 2391-2398 (2014) - [i12]Ramij Rahaman, Matthew Geoffrey Parker:
Quantum secret sharing based on local distinguishability. CoRR abs/1403.1097 (2014) - 2013
- [j23]Lars Eirik Danielsen, Matthew Geoffrey Parker:
The selfnegadual properties of generalised quadratic Boolean functions. Des. Codes Cryptogr. 66(1-3): 305-316 (2013) - [i11]Ramij Rahaman, Matthew Geoffrey Parker, Piotr Mironowicz, Marcin Pawlowski:
Device-independent quantum key distribution based on Hardy's paradox. CoRR abs/1308.6447 (2013) - [i10]Gaofei Wu, Matthew Geoffrey Parker:
A complementary construction using mutually unbiased bases. CoRR abs/1309.0157 (2013) - 2012
- [j22]Chunlei Li, Nian Li, Matthew Geoffrey Parker:
Complementary Sequence Pairs of Types II and III. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(11): 1819-1826 (2012) - [j21]Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes:
Random Edge-Local Complementation with Applications to Iterative Decoding of High-Density Parity-Check Codes. IEEE Trans. Commun. 60(10): 2796-2808 (2012) - 2011
- [j20]T. Aaron Gulliver, Matthew Geoffrey Parker:
Extended Binary Linear Codes from Legendre Sequences. Ars Comb. 100: 435-447 (2011) - [j19]Matthew Geoffrey Parker, Sasha Kholosha, Pascale Charpin, Eirik Rosnes:
Editorial. Des. Codes Cryptogr. 59(1-3): 1 (2011) - [j18]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Directed graph representation of half-rate additive codes over GF(4). Des. Codes Cryptogr. 59(1-3): 119-130 (2011) - [c18]Matthew Geoffrey Parker, Constanza Riera:
Generalised Complementary Arrays. IMACC 2011: 41-60 - [c17]Matthew Geoffrey Parker:
Complementary arrays - New directions. IWSDA 2011: 2 - 2010
- [j17]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Interlace polynomials: Enumeration, unimodality and connections to codes. Discret. Appl. Math. 158(6): 636-648 (2010) - [j16]Claude Carlet, Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé:
Self-dual bent functions. Int. J. Inf. Coding Theory 1(4): 384-399 (2010) - [c16]Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes:
Improved adaptive belief propagation decoding using edge-local complementation. ISIT 2010: 774-778 - [c15]Constanza Riera, Matthew Geoffrey Parker:
Boolean functions whose restrictions are highly nonlinear. ITW 2010: 1-5 - [i9]Lars Eirik Danielsen, Matthew Geoffrey Parker, Constanza Riera, Joakim Grahl Knudsen:
On Graphs and Codes Preserved by Edge Local Complementation. CoRR abs/1006.5802 (2010)
2000 – 2009
- 2009
- [j15]Kai-Uwe Schmidt, Jonathan Jedwab, Matthew Geoffrey Parker:
Two binary sequence families with large merit factor. Adv. Math. Commun. 3(2): 135-156 (2009) - [c14]Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé:
The Rayleigh Quotient of Bent Functions. IMACC 2009: 418-432 - [c13]Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes:
Iterative decoding on multiple tanner graphs using random edge local complementation. ISIT 2009: 899-903 - [p1]Tor E. Bjørstad, Matthew Geoffrey Parker:
Equivalence Between Certain Complementary Pairs of Types I and III. Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes 2009: 203-221 - [e2]Matthew Geoffrey Parker:
Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5921, Springer 2009, ISBN 978-3-642-10867-9 [contents] - [i8]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Directed Graph Representation of Half-Rate Additive Codes over GF(4). CoRR abs/0902.3883 (2009) - [i7]Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes:
Iterative Decoding on Multiple Tanner Graphs Using Random Edge Local Complementation. CoRR abs/0905.4164 (2009) - 2008
- [j14]Constanza Riera, Stéphane Jacob, Matthew Geoffrey Parker:
From graph states to two-graph states. Des. Codes Cryptogr. 48(2): 179-206 (2008) - [j13]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptogr. 49(1-3): 161-170 (2008) - [j12]Frank Fiedler, Jonathan Jedwab, Matthew Geoffrey Parker:
A multi-dimensional approach to the construction and enumeration of Golay complementary sequences. J. Comb. Theory A 115(5): 753-776 (2008) - [j11]Frank Fiedler, Jonathan Jedwab, Matthew Geoffrey Parker:
A Framework for the Construction ofGolay Sequences. IEEE Trans. Inf. Theory 54(7): 3114-3129 (2008) - [c12]Joakim Grahl Knudsen, Constanza Riera, Matthew Geoffrey Parker, Eirik Rosnes:
Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation. ICMCTA 2008: 82-94 - [c11]Matthew Geoffrey Parker:
Close Encounters with Boolean Functions of Three Different Kinds. ICMCTA 2008: 137-153 - [c10]Kai-Uwe Schmidt, Matthew Geoffrey Parker, Alexander Pott:
Negabent Functions in the Maiorana-McFarland Class. SETA 2008: 390-402 - [e1]Solomon W. Golomb, Matthew Geoffrey Parker, Alexander Pott, Arne Winterhof:
Sequences and Their Applications - SETA 2008, 5th International Conference, Lexington, KY, USA, September 14-18, 2008, Proceedings. Lecture Notes in Computer Science 5203, Springer 2008, ISBN 978-3-540-85911-6 [contents] - [i6]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes. CoRR abs/0804.2576 (2008) - 2007
- [j10]Jonathan Jedwab, Matthew Geoffrey Parker:
There are no Barker arrays having more than two dimensions. Des. Codes Cryptogr. 43(2-3): 79-84 (2007) - [j9]Jonathan Jedwab, Matthew Geoffrey Parker:
Golay complementary array pairs. Des. Codes Cryptogr. 44(1-3): 209-216 (2007) - [c9]Matthew Geoffrey Parker, Alexander Pott:
On Boolean Functions Which Are Bent and Negabent. SSC 2007: 9-23 - [i5]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Edge Local Complementation and Equivalence of Binary Linear Codes. CoRR abs/0710.2243 (2007) - 2006
- [j8]Lars Eirik Danielsen, T. Aaron Gulliver, Matthew Geoffrey Parker:
Aperiodic propagation criteria for Boolean functions. Inf. Comput. 204(5): 741-770 (2006) - [j7]Lars Eirik Danielsen, Matthew Geoffrey Parker:
On the classification of all self-dual additive codes over GF(4) of length up to 12. J. Comb. Theory A 113(7): 1351-1367 (2006) - [j6]Constanza Riera, Matthew Geoffrey Parker:
Generalized Bent Criteria for Boolean Functions (I). IEEE Trans. Inf. Theory 52(9): 4142-4159 (2006) - 2005
- [c8]T. Aaron Gulliver, Matthew Geoffrey Parker:
The multivariate merit factor of a Boolean function. ITW 2005: 58-62 - [c7]Constanza Riera, Matthew Geoffrey Parker:
One and Two-Variable Interlace Polynomials: A Spectral Interpretation. WCC 2005: 397-411 - [i4]Constanza Riera, Matthew Geoffrey Parker:
Generalised Bent Criteria for Boolean Functions (I). CoRR abs/cs/0502049 (2005) - [i3]Constanza Riera, George Petrides, Matthew Geoffrey Parker:
Generalised Bent Criteria for Boolean Functions (II). CoRR abs/cs/0502050 (2005) - [i2]Lars Eirik Danielsen, Matthew Geoffrey 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) - [i1]Lars Eirik Danielsen, Matthew Geoffrey Parker:
On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12. CoRR abs/math/0504522 (2005) - 2004
- [j5]Raymond A. Kristiansen, Matthew Geoffrey Parker:
Binary sequences with merit factor ge6.3. IEEE Trans. Inf. Theory 50(12): 3385-3389 (2004) - [c6]Matthew Geoffrey Parker:
Univariate and Multivariate Merit Factors. SETA 2004: 72-100 - [c5]Lars Eirik Danielsen, Matthew Geoffrey 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 - 2003
- [j4]T. W. Sze, Samuel T. Chanson, Cunsheng Ding, Tor Helleseth, Matthew Geoffrey Parker:
Logarithm cartesian authentication codes. Inf. Comput. 184(1): 93-108 (2003) - 2001
- [j3]Matthew Geoffrey Parker:
Quantum factor graphs. Ann. des Télécommunications 56(7-8): 472-483 (2001) - [j2]Matthew Geoffrey Parker, Chintha Tellambura:
Generalised Rudin-Shapiro Constructions. Electron. Notes Discret. Math. 6: 364-374 (2001) - [c4]Matthew Geoffrey Parker:
Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation. AAECC 2001: 200-209 - [c3]Matthew Geoffrey Parker:
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement. IMACC 2001: 339-354 - [c2]Matthew Geoffrey Parker, Vincent Rijmen:
The Quantum Entanglement of Binary and Bipolar Sequences. SETA 2001: 296-309
1990 – 1999
- 1999
- [j1]Chintha Tellambura, Matthew Geoffrey Parker, Y. Jay Guo, Simon J. Shepherd, Stephen K. Barton:
Optimal sequences for channel estimation using discrete Fourier transform techniques. IEEE Trans. Commun. 47(2): 230-238 (1999) - [c1]Matthew Geoffrey Parker:
Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. AAECC 1999: 420-429
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
