Skip to main content.

Journal Papers

[J2] Lars Eirik Danielsen and Matthew G. Parker: On the classification of all self-dual additive codes over GF(4) of length up to 12, Journal of Combinatorial Theory, Series A 113(7), pp. 1351–1367, October 2006.

[J1] Lars Eirik Danielsen, T. Aaron Gulliver, and Matthew G. Parker: Aperiodic propagation criteria for Boolean functions, Information and Computation, 204(5), pp. 741–770, May 2006.

Refereed Conference Papers

[C3] Lars Eirik Danielsen and Matthew G. Parker: Edge Local Complementation and Equivalence of Binary Linear Codes. To appear in Designs, Codes and Cryptography, special issue: Workshop on Coding and Cryptography 2007.

[C2] Lars Eirik Danielsen and Matthew G. Parker: On the classification of all self-dual additive codes over GF(4) of length up to 12. In Fourth International Workshop on Optimal Codes and Related Topics, pp. 47–52, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, June 2005. (ISBN 954-8986-18-3)

[C1] 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. In Sequences and Their Applications – SETA 2004, edited by T. Helleseth, D. Sarwate, H.-Y. Song, and K. Yang, Lecture Notes in Computer Science, volume 3486, pp. 373–388, Springer, Berlin, May 2005.

Thesis

[T1] Lars Eirik Danielsen: On Self-Dual Quantum Codes, Graphs, and Boolean Functions, Master's thesis, Department of Informatics, University of Bergen, Norway, March 2005.