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

Kenichiro Tanabe

dblp:90/490 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2004
0000-0002-0936-1596ORCID · reported

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

Security and privacy · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 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
1 paper
Coding theory · 67% Combinatorics and discrete mathematics · 33%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory
0.012000
An Assmus-Mattson theorem for Z4-codes · IEEE Trans. Inf. Theory 2000
Combinatorics and discrete mathematics
combinatorial design
0.012000
An Assmus-Mattson theorem for Z4-codes · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › codes over rings
z4-linear code
0.012000
An Assmus-Mattson theorem for Z4-codes · IEEE Trans. Inf. Theory 2000

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

harmonic weight enumerator · 0.0
YearPublicationVenuePosition
2004 On the Covering Radius of Ternary Extremal Self-Dual Codes
Masaaki Harada, Michio Ozeki, Kenichiro Tanabe
Des. Codes Cryptogr.3
2003 A Criterion for Designs in {\tf="P101461" Z}_4-codes on the Symmetrized Weight Enumerator
Kenichiro Tanabe
Des. Codes Cryptogr.1
2001 Automatic Signature Verification Based on the Dynamic Feature of Pressure
abstract
A feasibility experiment on an automatic signature verification system based on writing pressure was conducted using a new device sensing the z-axis component of writing pressure. The data acquisitions were conducted over a half a year for checking both subjects' and device stabilities. The DP (dynamic programming) matching method provided 6% error rates for type I and type II errors. The nature of signature writing pressure was investigated.
Kenichiro Tanabe, M. Yoshihara, Hiroshi Kameya, Shunji Mori, Sadao Omata, Tatsuro Ito
ICDAR1
2001 A New Proof of the Assmus-Mattson Theorem for Non-Binary Codes
Kenichiro Tanabe
Des. Codes Cryptogr.1
2000 An Assmus-Mattson theorem for Z4-codes
abstract
The Assmus-Mattson theorem is a method to find designs in linear codes over a finite field. The purpose of this paper is to give an analog of this theorem for Z/sub 4/-codes by using the harmonic weight enumerator introduced by Bachoc. This theorem can find some 5-designs in the lifted Golay code over Z/sub 4/ which were discovered previously by other methods.
Kenichiro Tanabe
IEEE Trans. Inf. Theory1