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.

Seiichi Namba

dblp:21/5511 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

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

Theory of computation · 2 · 1 first-authorSecurity and privacy · 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
2 papers
Information theory · 64% Coding theory · 36%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.011973
On the zero-error capacity of a noisy channel with feedback (Corresp.) · IEEE Trans. Inf. Theory 1973
Information theory › channel capacity
feedback capacity
0.011973
On the zero-error capacity of a noisy channel with feedback (Corresp.) · IEEE Trans. Inf. Theory 1973
Information theory › channel capacity
zero-error capacity
0.011973
On the zero-error capacity of a noisy channel with feedback (Corresp.) · IEEE Trans. Inf. Theory 1973
Coding theory › sequences
complementary sequences
0.011969
Even-shift orthogonal sequences · IEEE Trans. Inf. Theory 1969
Coding theory › sequences › sequence design › sequence family construction
orthogonal sequences
0.011969
Even-shift orthogonal sequences · IEEE Trans. Inf. Theory 1969
Coding theory › sequences
sequence design
0.011969
Even-shift orthogonal sequences · IEEE Trans. Inf. Theory 1969

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

graph classification · 0.0autocorrelation analysis · 0.0
YearPublicationVenuePosition
2003 Separating Encryption and Key Issuance in Digital Rights Management Systems
Goichiro Hanaoka, Kazuto Ogawa, Itsuro Murota, Go Ohtake, Keigo Majima, Kimiyuki Oyamada, Seiichi Gohshi, Seiichi Namba, Hideki Imai
ACISP8
1973 On the zero-error capacity of a noisy channel with feedback (Corresp.)
abstract
It is shown by Shannon that the zero-error capacity of a noisy channel may be increased with feedback. However, feedback cannot improve the zero-error capacity of all memoryless channels. The graphs of discrete memoryless channels are classified on the basis of whether feedback increases the zero-error capacity or not.
Seiichi Namba, Yasuo Taki
IEEE Trans. Inf. Theory1
1969 Even-shift orthogonal sequences
abstract
A class of binary sequences whose elements are either1or-1and whose autocorrelation function is0for all even shifts except the zero shift is discussed. These sequences will be calledEsequences. It is proved that everyEsequence is paired with anotherEsequence, its mate, so that the cross-correlation function between them is0for all even shifts including the zero shift. Using these sequences, new complete orthogonal function sets are derived. Several other important properties of these sequences are also obtained and the relations among these sequences, Golay's complementary sequences and Welti's quaternary codes are discussed.
Yasuo Taki, Hiroshi Miyakawa, Mitsutoshi Hatori, Seiichi Namba
IEEE Trans. Inf. Theory4