Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register. - Johannes Mykkeltveit (IEEE Trans. Computers, 1975)

The weight distribution of irreducible cyclic codes with block lengths n1((q1-1)/N). - Tor Helleseth; Torleiv Kløve; Johannes Mykkeltveit (Discret. Math., 1977)

Nonlinear Recurrences and Arithmetic Codes - Johannes Mykkeltveit (Inf. Control., 1977)

On the covering radius of binary codes (Corresp.). - Tor Helleseth; Torleiv Kløve; Johannes Mykkeltveit (IEEE Trans. Inf. Theory, 1978)

On the Cycle Structure of Some Nonlinear Shift Register Sequences - Johannes Mykkeltveit; Man-Keung Siu; Po Tong (Inf. Control., 1979)

The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.). - Johannes Mykkeltveit (IEEE Trans. Inf. Theory, 1980)

On the classification of deBruijn sequences. - Erik R. Hauge; Johannes Mykkeltveit (Discret. Math., 1996)

The analysis of De Bruijn sequences of non-extremal weight. - Erik R. Hauge; Johannes Mykkeltveit (Discret. Math., 1998)

A Proof of Simmons' Conjecture. - Tor Helleseth; Johannes Mykkeltveit (Des. Codes Cryptogr., 2004)

On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes. - George Petrides; Johannes Mykkeltveit (SETA, 2006)

Composition of recursions and nonlinear complexity of periodic binary sequences. - George Petrides; Johannes Mykkeltveit (Des. Codes Cryptogr., 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)

On cross joining de Bruijn sequences. - Johannes Mykkeltveit; Janusz Szmidt (IACR Cryptol. ePrint Arch., 2013)