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

Joseph T. Cordaro Jr.

dblp:134/3751 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1970
—ORCID · none

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

Theory of computation · 2 · 2 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
2 papers
Coding theory · 56% Information theory · 44%

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

TopicWeightPapersLastEvidence papers
Information theory
channel capacity
0.011970
Intersymbol interference on a continuous-time Gaussian channel · IEEE Trans. Inf. Theory 1970
Coding theory › channel coding
error probability bounds
0.011970
Intersymbol interference on a continuous-time Gaussian channel · IEEE Trans. Inf. Theory 1970
Coding theory › channel coding › error exponent
exponential error bounds
0.011970
Intersymbol interference on a continuous-time Gaussian channel · IEEE Trans. Inf. Theory 1970
Information theory › channel capacity
gaussian channel
0.011970
Intersymbol interference on a continuous-time Gaussian channel · IEEE Trans. Inf. Theory 1970
Information theory › communication channels
intersymbol interference
0.011970
Intersymbol interference on a continuous-time Gaussian channel · IEEE Trans. Inf. Theory 1970
Information theory › communication channels › channel models › binary-input channel
binary symmetric channel
0.011967
Optimum (n, 2) codes for small values of channel error probability (Corresp.) · IEEE Trans. Inf. Theory 1967
Coding theory › error-correcting codes
block codes
0.011967
Optimum (n, 2) codes for small values of channel error probability (Corresp.) · IEEE Trans. Inf. Theory 1967
Coding theory
channel coding
0.011967
Optimum (n, 2) codes for small values of channel error probability (Corresp.) · IEEE Trans. Inf. Theory 1967
Coding theory
error-correcting codes
0.011967
Optimum (n, 2) codes for small values of channel error probability (Corresp.) · IEEE Trans. Inf. Theory 1967
Coding theory › error-correcting codes
optimal codes
0.011967
Optimum (n, 2) codes for small values of channel error probability (Corresp.) · IEEE Trans. Inf. Theory 1967

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

reproducing kernel hilbert space · 0.0
YearPublicationVenuePosition
1970 Intersymbol interference on a continuous-time Gaussian channel
abstract
The effect on the probability of error from intersymbol interference caused by a repeated use of a continuous-time Gaussian channel is examined. The model assumes that signals that are power constrained are put through a linear filter after which Gaussian noise is added to produce the received signal. One can view the linear filter as a frequency constraint on the inputs. Because of the memory in the filter, past inputs affect the filter output for the current input. It is shown that this interference can be treated as an additional input whose reproducing kernel Hilbert space (RKHS) norm is upper bounded by a function that tends to 0 with increasing block length. Describing the channel in RKHS terms, we show that the exponential error bounds obtained by Gallager are unchanged if one takes intersymbol interference into account.
Joseph T. Cordaro Jr., Terry J. Wagner
IEEE Trans. Inf. Theory1
1967 Optimum (n, 2) codes for small values of channel error probability (Corresp.)
abstract
The generator matrices of(n, 2)codes which are optimum for the BSC with sufficiently small channel error probabilitypare given.
Joseph T. Cordaro Jr., Terry J. Wagner
IEEE Trans. Inf. Theory1