Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Sami Koponen

dblp:59/6472 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Theory of computation · 2 · 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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes
linear code		 0.011998
The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2 · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes
reed-muller codes		 0.011998
The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2 · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › codes over rings
z4-linear code		 0.011998
The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2 · IEEE Trans. Inf. Theory 1998
Coding theory › sequences › sequence design › correlation properties
aperiodic autocorrelation		 0.011997
On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences · IEEE Trans. Inf. Theory 1997
Coding theory › sequences › pseudorandom sequences
odd correlation		 0.011997
On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences · IEEE Trans. Inf. Theory 1997

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

automorphism analysis · 0.0vinogradov method · 0.0hybrid sums · 0.0galois rings · 0.0
YearPublicationVenuePosition
1998 The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2
abstract
After a discussion of automorphisms of Reed-Muller codes the authors show that the Reed-Muller code R(r,m) is not Z/sub 4/-linear for 3/spl les/r/spl les/m-2, proving a conjecture by Hammons, Kumar, Calderbank, Sloane, and Sole (1994).
Xiang-dong Hou, Jyrki T. Lahtonen, Sami Koponen
 IEEE Trans. Inf. Theory3
1997 On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences
abstract
A previously derived upper bound on hybrid sums over Galois rings is combined with a method due to Vinogradov (1954) to obtain an upper bound for the maximum aperiodic and odd correlations of the binary sequences constructed by Shanbhag, Kumar, and Helleseth (see Proc. 1995 IEEE Int. Symp. on Information Theory, 1995).
Sami Koponen, Jyrki T. Lahtonen
 IEEE Trans. Inf. Theory1