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

Seiji Takano

dblp:49/351 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1977
—ORCID · none

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

Theory of computation · 3 · 3 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
3 papers
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › channel capacity › single-letter characterization
information stability
0.021977
On a strong law in information stability (Corresp.) · IEEE Trans. Inf. Theory 1977
On Some Stationary Transmissionary Invariant Properties and Information Stability · Inf. Control. 1974
Information theory
channel capacity
0.021975
On a Method of Calculating the Capacity of a Discrete Memoryless Channel · Inf. Control. 1975
On Some Stationary Transmissionary Invariant Properties and Information Stability · Inf. Control. 1974
Information theory › channel capacity › coding theorem
channel coding theorem
0.011977
On a strong law in information stability (Corresp.) · IEEE Trans. Inf. Theory 1977
Information theory › channel capacity
coding theorem
0.011977
On a strong law in information stability (Corresp.) · IEEE Trans. Inf. Theory 1977
Information theory › probability theory › stochastic processes
stationary processes
0.011974
On Some Stationary Transmissionary Invariant Properties and Information Stability · Inf. Control. 1974

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

martingale convergence · 0.0iterated logarithm · 0.0capacity calculation · 0.0
YearPublicationVenuePosition
1977 On a strong law in information stability (Corresp.)
abstract
The law of the iterated logarithm for the information density between channel input and output sequences is established when certain regularity conditions are imposed on both the input source and on the finite-memory channel. An application to the coding theorem and its converse is given.
Seiji Takano
IEEE Trans. Inf. Theory1
1975 On a Method of Calculating the Capacity of a Discrete Memoryless Channel
Seiji Takano
Inf. Control.1
1974 On Some Stationary Transmissionary Invariant Properties and Information Stability
Seiji Takano
Inf. Control.1