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

René Struik

dblp:86/3812 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none

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

Theory of computation · 3 · 2 first-authorSecurity and privacy · 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
2 papers
Coding theory · 81% Computational complexity · 9% Logic in computer science · 9%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
covering codes		 0.021994
On the structure of linear codes with covering radius two and three · IEEE Trans. Inf. Theory 1994
An improvement of the Van Wee bound for binary linear covering codes · IEEE Trans. Inf. Theory 1994
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
chosen-plaintext attack		 0.011987
The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack · CRYPTO 1987
Coding theory › error-correcting codes › coding bounds
code length bounds		 0.011994
On the structure of linear codes with covering radius two and three · IEEE Trans. Inf. Theory 1994
Logic in computer science › proof theory
combinatorial proof		 0.011994
On the structure of linear codes with covering radius two and three · IEEE Trans. Inf. Theory 1994
Coding theory › error-correcting codes
covering radius		 0.011994
An improvement of the Van Wee bound for binary linear covering codes · IEEE Trans. Inf. Theory 1994
Computational complexity
lower bounds		 0.011994
An improvement of the Van Wee bound for binary linear covering codes · IEEE Trans. Inf. Theory 1994

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

combinatorial bounds · 0.0combinatorial analysis · 0.0coding theory results · 0.0bound improvement · 0.0chosen-plaintext attack · 0.0
YearPublicationVenuePosition
1998 On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance
Simon Litsyn, Patrick Solé, René Struik
 Discret. Appl. Math.3
1994 An improvement of the Van Wee bound for binary linear covering codes
abstract
The Van Wee bound gives a lower bound on the cardinality of (block) codes with a prescribed covering radius. The author presents an improvement of this bound for binary linear codes and compares the results with other bounds mentioned in the literature. Almost all reported bounds can be obtained via the present bound as well; moreover, the present authors obtain a number of new lower bounds.>
René Struik
 IEEE Trans. Inf. Theory1
1994 On the structure of linear codes with covering radius two and three
abstract
We obtain new bounds on l(m,r), the minimum length of a linear code with codimension m and covering radius r. All bounds are derived in a uniform way. We employ results from coding theory, some earlier results on covering codes, and combinatorial arguments. We prove the following bounds: l(6, 2)=13, l(7,2)=19, l(8,2)/spl ges/25, l(9,2)/spl ges/34, l(2m-l,2)/spl ges/2/sup m/+1 for m/spl ges/3, l(14,2)/spl ges/182, l(16,2)/spl ges/363, l(18,2)/spl ges/725, l(20,2)/spl ges/1449, l(22,2)/spl ges/2897, l(24,2)/spl ges/5794, l(9,3)/spl ges/17, l(10,3)/spl ges/21, l(12,3)/spl ges/31, l(13,3)/spl ges/38.>
René Struik
 IEEE Trans. Inf. Theory1
1987 The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack
René Struik, Johan van Tilburg
 CRYPTO1