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

Noboru Hamada

dblp:39/984 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2000
—ORCID · none

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

Security and privacy · 4 · 3 first-authorTheory of computation · 3 · 2 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% Combinatorics and discrete mathematics · 0%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes		 0.012000
There is no ternary [28, 6, 16] code · IEEE Trans. Inf. Theory 2000
Coding theory
nonexistence proofs		 0.012000
There is no ternary [28, 6, 16] code · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › q-ary codes
ternary codes		 0.012000
There is no ternary [28, 6, 16] code · IEEE Trans. Inf. Theory 2000
Indexing and storage engines › file organization
balanced file organization		 0.011975
Design of a New Balanced File Organization Scheme With the Least Redundancy · Inf. Control. 1975
Indexing and storage engines
file organization		 0.011975
Design of a New Balanced File Organization Scheme With the Least Redundancy · Inf. Control. 1975
Combinatorics and discrete mathematics
combinatorial design		 0.011975
Design of a New Balanced File Organization Scheme With the Least Redundancy · Inf. Control. 1975

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

generator matrix analysis · 0.0computer search · 0.0
YearPublicationVenuePosition
2000 There is no ternary [28, 6, 16] code
abstract
The existence of a ternary [28, 6, 16] code is considered. We show that without loss of generality, a generator matrix of such a code must satisfy certain conditions. A computer search over all matrices that satisfy these conditions reveals that a ternary [28, 6, 16] code does not exist.
Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus
 IEEE Trans. Inf. Theory1
1998 The Nonexistence of Ternary [38, 6, 23] Codes
Noboru Hamada, Marijn van Eupen
 Des. Codes Cryptogr.1
1997 A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound
Noboru Hamada
 Des. Codes Cryptogr.1
1996 The Nonexistence of Ternary [50, 5, 32] Codes
Marijn van Eupen, Noboru Hamada, Yoko Watamori
 Des. Codes Cryptogr.2
1993 A New Class of Nonbinary Codes Meeting the Griesmer Bound
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
 Discret. Appl. Math.1
1992 On the Construction of [q4 + q2 - q, 5, q4 - q3 + q2 - 2q; q]-Codes Meeting the Griesmer Bound
Noboru Hamada, Tor Helleseth, Øyvind Ytrehus
 Des. Codes Cryptogr.1
1975 Design of a New Balanced File Organization Scheme With the Least Redundancy
Sumiyasu Yamamoto, Hideto Ikeda, Shinsei Shige-eda, Kazuhiko Ushio, Noboru Hamada
 Inf. Control.5