EDBT 2026 Demo / reviewers in the wild / expert

Johannes Mykkeltveit

dblp:14/5844 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 3 first-authorSecurity and privacy · 3Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
5 papers
Coding theory · 88% Combinatorics and discrete mathematics · 12%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
covering radius		 0.021980
The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.) · IEEE Trans. Inf. Theory 1980
On the covering radius of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1978
Coding theory › error-correcting codes
reed-muller codes		 0.021980
The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.) · IEEE Trans. Inf. Theory 1980
On the covering radius of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1978
Coding theory › sequences › linear recurrence sequences
shift register sequences		 0.011979
On the Cycle Structure of Some Nonlinear Shift Register Sequences · Inf. Control. 1979
Coding theory › error-correcting codes › block codes
linear code		 0.011978
On the covering radius of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1978
Coding theory › error-correcting codes
arithmetic codes		 0.011977
Nonlinear Recurrences and Arithmetic Codes · Inf. Control. 1977
Coding theory › error-correcting codes › q-ary codes
binary codes		 0.011978
On the covering radius of binary codes (Corresp.) · IEEE Trans. Inf. Theory 1978
Combinatorics and discrete mathematics
enumeration		 0.011975
Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register · IEEE Trans. Computers 1975

Methods — techniques the papers use, named apart from their topics

combinatorial bounds · 0.0counting theorem · 0.0combinatorial construction · 0.0
YearPublicationVenuePosition
2008 Composition of recursions and nonlinear complexity of periodic binary sequences
George Petrides, Johannes Mykkeltveit
 Des. Codes Cryptogr.2
2006 On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes
George Petrides, Johannes Mykkeltveit
 SETA2
2004 A Proof of Simmons' Conjecture
Tor Helleseth, Johannes Mykkeltveit
 Des. Codes Cryptogr.2
1980 The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.)
abstract
Letr_{i}be the covering radius of the(2^{i},i+ 1)Reed-Muller code. It is an open question whetherr_{2m+1}=2^{2_{m}}-2mholds for allm. It is known to be true form=0,1,2, and here it is shown to be also true form=3.
Johannes Mykkeltveit
 IEEE Trans. Inf. Theory1
1979 On the Cycle Structure of Some Nonlinear Shift Register Sequences
Johannes Mykkeltveit, Man-Keung Siu, Po Tong
 Inf. Control.1
1978 On the covering radius of binary codes (Corresp.)
abstract
Upper bounds on the covering radius of binary codes are studied. In particular it is shown that the covering radiusr_{m}of the first-order Reed-Muller code of lenglh2^{m}satisfies2^{m-l}-2^{\lceil m/2 \rceil -1} r_{m} \leq 2^{m-1}-2^{m/2-1}.
Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit
 IEEE Trans. Inf. Theory3
1977 Nonlinear Recurrences and Arithmetic Codes
Johannes Mykkeltveit
 Inf. Control.1
1975 Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register
abstract
Magleby [6] proved that there can exist at most two adjacencies between a pair of cycles of a pure circulating register. We give a theorem (Theorem 1) for construction of all such pairs of cycles, and our theorem enables us to count them.
Johannes Mykkeltveit
 IEEE Trans. Computers1