Lars Eirik Danielsen

According to our database, Lars Eirik Danielsen authored at least 19 papers between 2004 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2015

On graphs and codes preserved by edge local complementation.

Lars Eirik Danielsen, Matthew Geoffrey Parker, Constanza Riera, Joakim Grahl Knudsen

Des. Codes Cryptogr., 2015

2013

The selfnegadual properties of generalised quadratic Boolean functions.

Lars Eirik Danielsen, Matthew Geoffrey Parker

Des. Codes Cryptogr., 2013

2012

On the Classification of Hermitian Self-Dual Additive Codes Over GF(9).

Lars Eirik Danielsen

IEEE Trans. Inf. Theory, 2012

Random Edge-Local Complementation with Applications to Iterative Decoding of High-Density Parity-Check Codes.

Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes

IEEE Trans. Commun., 2012

2011

Directed graph representation of half-rate additive codes over GF(4).

Lars Eirik Danielsen, Matthew Geoffrey Parker

Des. Codes Cryptogr., 2011

Quantum social networks

Adán Cabello, Lars Eirik Danielsen, Antonio J. Lopez-Tarrida, José Ramón Portillo

CoRR, 2011

2010

Self-dual bent functions.

Claude Carlet, Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé

Int. J. Inf. Coding Theory, 2010

Interlace polynomials: Enumeration, unimodality and connections to codes.

Lars Eirik Danielsen, Matthew Geoffrey Parker

Discret. Appl. Math., 2010

Improved adaptive belief propagation decoding using edge-local complementation.

Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes

Proceedings of the IEEE International Symposium on Information Theory, 2010

On the classification of self-dual additive codes over GF(9).

Lars Eirik Danielsen

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Graph-based classification of self-dual additive codes over finite fields.

Lars Eirik Danielsen

Adv. Math. Commun., 2009

Iterative decoding on multiple tanner graphs using random edge local complementation.

Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes

Proceedings of the IEEE International Symposium on Information Theory, 2009

The Rayleigh Quotient of Bent Functions.

Lars Eirik Danielsen, Matthew Geoffrey Parker, Patrick Solé

Proceedings of the Cryptography and Coding, 2009

2008

Edge local complementation and equivalence of binary linear codes.

Lars Eirik Danielsen, Matthew Geoffrey Parker

Des. Codes Cryptogr., 2008

2006

On the classification of all self-dual additive codes over GF(4) of length up to 12.

Lars Eirik Danielsen, Matthew Geoffrey Parker

J. Comb. Theory A, 2006

Aperiodic propagation criteria for Boolean functions.

Lars Eirik Danielsen, T. Aaron Gulliver, Matthew Geoffrey Parker

Inf. Comput., 2006

2005

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform

Lars Eirik Danielsen, Matthew Geoffrey Parker

CoRR, 2005

On Self-Dual Quantum Codes, Graphs, and Boolean Functions.

Lars Eirik Danielsen

CoRR, 2005

2004

Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}ⁿ Transform.

Lars Eirik Danielsen, Matthew Geoffrey Parker

Proceedings of the Sequences and Their Applications, 2004