#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2004

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lars Eirik Danielsen, Matthew G. Parker
- J. Comb. Theory, Ser. A
- 2006

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropicâ€¦ (More)

- Lars Eirik Danielsen
- ArXiv
- 2005

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We showâ€¦ (More)

- Claude Carlet, Lars Eirik Danielsen, Matthew G. Parker, Patrick SolÃ©
- IJICoT
- 2010

A bent function is called self-dual if it is equal to its dual. It is called anti-self-dual if it is equal to the complement of its dual. A spectral characterization in terms of the Rayleigh quotientâ€¦ (More)

- Lars Eirik Danielsen, Matthew G. Parker
- Des. Codes Cryptography
- 2011

We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs.â€¦ (More)

- Lars Eirik Danielsen, T. Aaron Gulliver, Matthew G. Parker
- Inf. Comput.
- 2006

We characterise aperiodic autocorrelation for a boolean function, f , and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong similarity between APC andâ€¦ (More)

Safe dike heights are crucial for protecting life in the Netherlands and many other regions of the world. We discuss issues that arise when modelling the probability of floods, the expected damageâ€¦ (More)

- Lars Eirik Danielsen, Matthew G. Parker
- SETA
- 2004

We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. Theseâ€¦ (More)

- Lars Eirik Danielsen, Matthew G. Parker
- Des. Codes Cryptography
- 2008

Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. Theâ€¦ (More)

- Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, Eirik Rosnes
- 2009 IEEE International Symposium on Informationâ€¦
- 2009

In this paper, we propose to enhance the performance of the sum-product algorithm (SPA) by interleaving SPA iterations with a random local graph update rule. This rule is known as edge localâ€¦ (More)

- Lars Eirik Danielsen
- ArXiv
- 2011