default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Eirik Danielsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j11]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)- 2013
- [j10]Lars Eirik Danielsen
, Matthew Geoffrey Parker:
The selfnegadual properties of generalised quadratic Boolean functions. Des. Codes Cryptogr. 66(1-3): 305-316 (2013) - 2012
- [j9]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) - [j8]Lars Eirik Danielsen:
On the Classification of Hermitian Self-Dual Additive Codes Over GF(9). IEEE Trans. Inf. Theory 58(8): 5500-5511 (2012) - 2011
- [j7]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) - [i11]Lars Eirik Danielsen:
Classification of Hermitian self-dual additive codes over GF(9). CoRR abs/1106.2428 (2011) - [i10]Adán Cabello, Lars Eirik Danielsen, Antonio J. Lopez-Tarrida, José Ramón Portillo:
Quantum social networks. CoRR abs/1112.0617 (2011) - 2010
- [j6]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Interlace polynomials: Enumeration, unimodality and connections to codes. Discret. Appl. Math. 158(6): 636-648 (2010) - [j5]Claude Carlet, Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé:
Self-dual bent functions. Int. J. Inf. Coding Theory 1(4): 384-399 (2010) - [c5]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 - [c4]Lars Eirik Danielsen:
On the classification of self-dual additive codes over GF(9). ISIT 2010: 1188-1192 - [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
- [j4]Lars Eirik Danielsen:
Graph-based classification of self-dual additive codes over finite fields. Adv. Math. Commun. 3(4): 329-348 (2009) - [c3]Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé:
The Rayleigh Quotient of Bent Functions. IMACC 2009: 418-432 - [c2]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 - [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
- [j3]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptogr. 49(1-3): 161-170 (2008) - [i6]Lars Eirik Danielsen:
Graph-Based Classification of Self-Dual Additive Codes over Finite Fields. CoRR abs/0801.3773 (2008) - [i5]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes. CoRR abs/0804.2576 (2008) - 2007
- [i4]Lars Eirik Danielsen, Matthew Geoffrey Parker:
Edge Local Complementation and Equivalence of Binary Linear Codes. CoRR abs/0710.2243 (2007) - 2006
- [j2]Lars Eirik Danielsen, T. Aaron Gulliver, Matthew Geoffrey Parker:
Aperiodic propagation criteria for Boolean functions. Inf. Comput. 204(5): 741-770 (2006) - [j1]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) - 2005
- [i3]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) - [i2]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) - [i1]Lars Eirik Danielsen:
On Self-Dual Quantum Codes, Graphs, and Boolean Functions. CoRR abs/quant-ph/0503236 (2005) - 2004
- [c1]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
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-06-10 20:25 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:
