Papers in International Journals
Lars Eirik Danielsen, Matthew G. Parker, Constanza Riera, and Joakim Grahl Knudsen. On graphs and codes preserved by edge local complementation. Des. Codes Cryptogr. To appear. (doi)
Adán Cabello, Lars Eirik Danielsen, Antonio J. López-Tarrida, and José R. Portillo. Basic exclusivity graphs in quantum correlations. Phys. Rev. A 88(3), 032104 (7 pp.), 2013. (doi)
Lars Eirik Danielsen and Matthew G. Parker. The selfnegadual properties of generalised quadratic Boolean functions. Des. Codes Cryptogr. 66, pp. 305–316, 2013. (doi)
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes. Random edge-local complementation with applications to iterative decoding of high-density parity-check codes. IEEE Trans. Comm. 60(10), pp. 2796–2808, 2012 (doi)
Lars Eirik Danielsen. On the classification of Hermitian self-dual additive codes over GF(9). IEEE Trans. Inform. Theory 58(8), pp. 5500–5511, 2012. (doi)
Adán Cabello, Lars Eirik Danielsen, Antonio J. López-Tarrida, and José R. Portillo. Quantum social networks. J. Phys. A 45(28), 285101 (9 pp.), 2012. (doi)
Elias Amselem, Lars Eirik Danielsen, Antonio J. López-Tarrida, José R. Portillo, Mohamed Bourennane, and Adán Cabello. Experimental fully contextual correlations. Phys. Rev. Lett. 108(20), 200405 (5 pp.), 2012. (doi)
Adán Cabello, Lars Eirik Danielsen, Antonio J. López-Tarrida, and José R. Portillo. Optimal preparation of graph states. Phys. Rev. A 83(4), 042314 (7 pp.), 2011. (doi)
Lars Eirik Danielsen and Matthew G. Parker. Directed graph representation of half-rate additive codes over GF(4). Des. Codes Cryptogr. 59, pp. 119–130, 2011. (doi)
Claude Carlet, Lars Eirik Danielsen, Matthew G. Parker, and Patrick Solé. Self-dual bent functions. Int. J. Inf. Coding Theory 1(4), pp. 384–399, 2010. (doi)
Lars Eirik Danielsen and Matthew G. Parker. Interlace polynomials: Enumeration, unimodality, and connections to codes. Discrete Appl. Math. 158(6), pp. 636–648, 2010. (doi)
Lars Eirik Danielsen. Graph-based classification of self-dual additive codes over finite fields. Adv. Math. Commun. 3(4), pp. 329–348, 2009. (doi)
Lars Eirik Danielsen and Matthew G. Parker. Edge local complementation and equivalence of binary linear codes. Des. Codes Cryptogr. 49, pp. 161–170, 2008. (doi)
Lars Eirik Danielsen and Matthew G. Parker. On the classification of all self-dual additive codes over GF(4) of length up to 12. J. Combin. Theory Ser. A 113(7), pp. 1351–1367, 2006. (doi)
Lars Eirik Danielsen, T. Aaron Gulliver, and Matthew G. Parker. Aperiodic propagation criteria for Boolean functions. Inform. and Comput. 204(5), pp. 741–770, 2006. (doi)
^ TOPPapers in Book Series
Lars Eirik Danielsen, Matthew G. Parker, and Patrick Solé. The Rayleigh quotient of bent functions. 12th IMA International Conference on Cryptography and Coding, 15–17 Dec. 2009, Cirencester, UK. (Proceedings: Lecture Notes in Comput. Sci. 5921, pp. 418–432, 2009) (doi)
Lars Eirik Danielsen and Matthew G. Parker. Spectral orbits and peak-to-average power ratio of Boolean functions with respect to the {I,H,N}n transform. Third International Conference on Sequences and Their Applications (SETA 2004), 24–28 Oct. 2004, Seoul, Korea. (Revised Selected Papers: Lecture Notes in Comput. Sci. 3486, pp. 373–388, 2005) (doi)
^ TOPRefereed Papers in International Conference Proceedings
Lars Eirik Danielsen and Matthew G. Parker. The selfnegadual properties of generalised quadratic Boolean functions. Seventh International Workshop on Coding and Cryptography (WCC 2011), 11–15 Apr. 2011, Paris, France. (pp. 361–370)
Lars Eirik Danielsen. On the classification of self-dual additive codes over GF(9). IEEE International Symposium on Information Theory (ISIT 2010), 13–18 Jun. 2010, Austin, TX, USA. (pp. 1188–1192) (doi)
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes. Improved adaptive belief propagation decoding using edge-local complementation. IEEE International Symposium on Information Theory (ISIT 2010), 13–18 Jun. 2010, Austin, TX, USA. (pp. 774–778) (doi)
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes. On iterative decoding of HDPC codes using weight-bounding graph operations. 21st International Zurich Seminar on Communications (IZS 2010), 3–5 Mar. 2010, Zurich, Switzerland. (pp. 98–101) (doi)
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes. Iterative decoding on multiple Tanner graphs using random edge local complementation. IEEE International Symposium on Information Theory (ISIT 2009), 28 Jun.–3 Jul. 2009, Seoul, Korea. (pp. 899–903) (doi)
Lars Eirik Danielsen and Matthew G. Parker. Directed graph representation of half-rate additive codes over GF(4). Sixth International Workshop on Coding and Cryptography (WCC 2009), 10–15 May 2009, Ullensvang, Norway. (pp. 128–140)
Claude Carlet, Lars Eirik Danielsen, Matthew G. Parker, and Patrick Solé. Self-dual bent functions. Fourth International Workshop on Boolean Functions: Cryptography and Applications (BFCA 2008), 19–21 May 2008, Copenhagen, Denmark. (pp. 39–52)
Lars Eirik Danielsen and Matthew G. Parker. Edge local complementation and equivalence of binary linear codes. Fifth International Workshop on Coding and Cryptography (WCC 2007), 16–20 Apr. 2007, Versailles, France. (pp. 117–126)
Lars Eirik Danielsen and Matthew G. Parker. On the classification of all self-dual additive codes over GF(4) of length up to 12. Fourth International Workshop on Optimal Codes and Related Topics (OC 2005), 17–23 Jun. 2005, Pamporovo, Bulgaria. (pp. 89–95)
^ TOPOther Conference Contributions
Lars Eirik Danielsen, Matthew G. Parker, Constanza Riera, and Joakim Grahl Knudsen. On graphs preserved by edge local complementation. 10th Nordic Combinatorial Conference (NORCOM 2010), 26–28 May 2010, Reykjavik, Iceland.
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes. On iterative decoding of HDPC codes using weight-bounding graph operations. Workshop on Linear Programming and Message-Passing Approaches to High-Density Parity-Check Codes and High-Density Graphical Models, 1–2 Mar. 2010, Tel Aviv, Israel.
Lars Eirik Danielsen, Constanza Riera, and Matthew G. Parker. Graph equivalence from equivalent quantum states. 20th British Combinatorial Conference (BCC 2005), 10–15 Jul. 2005, Durham, UK.
^ TOPTechnical Reports
Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, and Eirik Rosnes. Random edge-local complementation with applications to iterative decoding of HDPC codes. Reports in Informatics 395, University of Bergen, Norway, Aug. 2010.
^ TOPTheses
Lars Eirik Danielsen. On Connections Between Graphs, Codes, Quantum States, and Boolean Functions. PhD thesis, University of Bergen, Norway, May 2008. (hdl)
Lars Eirik Danielsen. On Self-Dual Quantum Codes, Graphs, and Boolean Functions. Master's thesis, University of Bergen, Norway, Mar. 2005. (hdl)