Johannes Mykkeltveit

According to our database, Johannes Mykkeltveit authored at least 13 papers between 1975 and 2013.

Collaborative distances:

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

2013

On cross joining de Bruijn sequences.

Johannes Mykkeltveit, Janusz Szmidt

IACR Cryptol. ePrint Arch., 2013

2008

Symmetric Positive Definite Flux-Continuous Full-Tensor Finite-Volume Schemes on Unstructured Cell-Centered Triangular Grids.

Helmer André Friis, Michael G. Edwards, Johannes Mykkeltveit

SIAM J. Sci. Comput., 2008

Composition of recursions and nonlinear complexity of periodic binary sequences.

George Petrides, Johannes Mykkeltveit

Des. Codes Cryptogr., 2008

2006

On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes.

George Petrides, Johannes Mykkeltveit

Proceedings of the Sequences and Their Applications, 2006

2004

A Proof of Simmons' Conjecture.

Tor Helleseth, Johannes Mykkeltveit

Des. Codes Cryptogr., 2004

1998

The analysis of De Bruijn sequences of non-extremal weight.

Erik R. Hauge, Johannes Mykkeltveit

Discret. Math., 1998

1996

On the classification of deBruijn sequences.

Erik R. Hauge, Johannes Mykkeltveit

Discret. Math., 1996

1980

The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.).

Johannes Mykkeltveit

IEEE Trans. Inf. Theory, 1980

1979

On the Cycle Structure of Some Nonlinear Shift Register Sequences

Johannes Mykkeltveit, Man-Keung Siu, Po Tong

Inf. Control., November, 1979

1978

On the covering radius of binary codes (Corresp.).

Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit

IEEE Trans. Inf. Theory, 1978

1977

Nonlinear Recurrences and Arithmetic Codes

Johannes Mykkeltveit

Inf. Control., March, 1977

The weight distribution of irreducible cyclic codes with block lengths n₁((q¹-1)/N).

Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit

Discret. Math., 1977

1975

Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register.

Johannes Mykkeltveit

IEEE Trans. Computers, 1975