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.

John L. Kelly

dblp:38/3764 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Software engineering, systems software and programming languages · 1Theory 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
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › channel capacity
information rate
0.011956
A new interpretation of information rate · IRE Trans. Inf. Theory 1956
Information theory
communication channels
0.011956
A new interpretation of information rate · IRE Trans. Inf. Theory 1956
Information theory
transmission rate
0.011956
A new interpretation of information rate · IRE Trans. Inf. Theory 1956

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

exponential growth analysis · 0.0
YearPublicationVenuePosition
2008 Bytecode fault injection for Java software
Sudipto Ghosh 0001, John L. Kelly
J. Syst. Softw.2
1956 A new interpretation of information rate
abstract
If the input symbols to a communication channel represent the outcomes of a chance event on which bets are available at odds consistent with their probabilities (i.e., "fair" odds), a gambler can use the knowledge given him by the received symbols to cause his money to grow exponentially. The maximum exponential rate of growth of the gambler's capital is equal to the rate of transmission of information over the channel. This result is generalized to include the case of arbitrary odds. Thus we find a situation in which the transmission rate has significance even though no coding is contemplated. Previously this quantity was given significance only by a theorem of Shannon's which asserted that, with suitable encoding, binary digits could be transmitted over the channel at this rate with an arbitrarily small probability of error.
John L. Kelly
IRE Trans. Inf. Theory1