Demo Data from VLDB 2026 / reviewers in the wild / expert
Takayuki Yoshiwara
dblp:53/4501
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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
1 paper |
Coding theory · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
boolean functions |
0.0 | 1 | 2004 | New covering radius of Reed-Muller codes for t-resilient functions · IEEE Trans. Inf. Theory 2004 |
Cryptographic primitives and cryptanalysis › boolean functions
resilient functions |
0.0 | 1 | 2004 | New covering radius of Reed-Muller codes for t-resilient functions · IEEE Trans. Inf. Theory 2004 |
Coding theory › error-correcting codes
coding bounds |
0.0 | 1 | 2004 | New covering radius of Reed-Muller codes for t-resilient functions · IEEE Trans. Inf. Theory 2004 |
Coding theory › error-correcting codes
covering radius |
0.0 | 1 | 2004 | New covering radius of Reed-Muller codes for t-resilient functions · IEEE Trans. Inf. Theory 2004 |
Coding theory › error-correcting codes › covering radius
covering radius bound |
0.0 | 1 | 2004 | New covering radius of Reed-Muller codes for t-resilient functions · IEEE Trans. Inf. Theory 2004 |
Coding theory › error-correcting codes
reed-muller codes |
0.0 | 1 | 2004 | New covering radius of Reed-Muller codes for t-resilient functions · IEEE Trans. Inf. Theory 2004 |
Methods — techniques the papers use, named apart from their topics
lower and upper bounds · 0.1distance analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | New covering radius of Reed-Muller codes for t-resilient functionsabstractIn this paper, we introduce a new covering radius of RM(r,n) from cryptography viewpoint. It is defined as the maximum distance between t-resilient functions and the rth order Reed-Muller code RM(r,n). We next derive its lower and upper bounds. We further present a table of numerical data of our bounds. Kaoru Kurosawa, Tetsu Iwata, Takayuki Yoshiwara |
IEEE Trans. Inf. Theory | 3 |