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

Thomas J. Goblick Jr.

dblp:134/0692 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1969
—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
Coding theory · 82% Information theory · 18%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding
rate-distortion theory
0.031969
A coding theorem for time-discrete analog data sources · IEEE Trans. Inf. Theory 1969
Theoretical limitations on the transmission of data from analog sources · IEEE Trans. Inf. Theory 1965
Analog source digitization: A comparison of theory and practice (Corresp.) · IEEE Trans. Inf. Theory 1967
Coding theory
source coding
0.021969
A coding theorem for time-discrete analog data sources · IEEE Trans. Inf. Theory 1969
Analog source digitization: A comparison of theory and practice (Corresp.) · IEEE Trans. Inf. Theory 1967
Information theory › channel capacity
coding theorem
0.011969
A coding theorem for time-discrete analog data sources · IEEE Trans. Inf. Theory 1969
Coding theory › source coding › source modeling
ergodic sources
0.011969
A coding theorem for time-discrete analog data sources · IEEE Trans. Inf. Theory 1969
Coding theory › source coding › rate-distortion theory
rate-distortion function
0.011965
Theoretical limitations on the transmission of data from analog sources · IEEE Trans. Inf. Theory 1965
Coding theory › joint source-channel coding
source-channel separation
0.011965
Theoretical limitations on the transmission of data from analog sources · IEEE Trans. Inf. Theory 1965
Physical-layer communications › modulation
amplitude-phase modulation
0.011965
Theoretical limitations on the transmission of data from analog sources · IEEE Trans. Inf. Theory 1965
Physical-layer communications
modulation
0.011965
Theoretical limitations on the transmission of data from analog sources · IEEE Trans. Inf. Theory 1965
Coding theory › source coding
gaussian source
0.011965
Theoretical limitations on the transmission of data from analog sources · IEEE Trans. Inf. Theory 1965
Information theory › information measures › shannon information measures
shannon information
0.011969
A coding theorem for time-discrete analog data sources · IEEE Trans. Inf. Theory 1969

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

shannon theory · 0.0fidelity criterion · 0.0average distortion · 0.0
YearPublicationVenuePosition
1969 A coding theorem for time-discrete analog data sources
abstract
The main result of the paper is a coding theorem for time-discrete sources with a fidelity criterion on average distortion. This result applies to a subclass of the ergodic sources (stationary sources having a strong mixing property) and to the cases in which source samples are continuously distributed (analog) quantities or discrete symbols. An intuitive definition of the information content of data samples for this class of sources is then formally established and is shown to be exactly the same as Shannon's definition.
Thomas J. Goblick Jr.
IEEE Trans. Inf. Theory1
1967 Analog source digitization: A comparison of theory and practice (Corresp.)
Thomas J. Goblick Jr., Jerry L. Holsinger
IEEE Trans. Inf. Theory1
1965 Theoretical limitations on the transmission of data from analog sources
abstract
Fundamental limitations on the performance of any type of communication system transmitting data from an analog source may be obtained by application of a theorem in Shannon's original paper on information theory. In order to transmit the output of an analog source to a sink with mean-squared error e or less, it is necessary to transmit information from source to sink at rates greater than some minimal rateR(\epsilon)bits per second. If a channel of capacityCbits per second is used, then in order for any communication system to be able to achieve\epsilonmean-squared error or less with this channel it is necessary thatR(\epsilon) \leq C. This inequality can be used to determine the minimum mean-squared error obtainable for a given source-channel pair without discussing any particular communication system. As an example, the minimum mean-squared error is calculated for cases in which the analog source and additive channel noise are stationary, Gaussian processes. The performance of amplitude and angle modulation systems is compared to the theoretically ideal performance obtainable in some of these cases.
Thomas J. Goblick Jr.
IEEE Trans. Inf. Theory1