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

Abdul J. Jerri

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

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

Databases, data management, data science and information retrieval · 1 · 1 first-authorTheory 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › signal processing › sampling theory
sampling theorem
0.011969
On the equivalence of Kramer's and Shannon's sampling theorems (Corresp.) · IEEE Trans. Inf. Theory 1969
Information theory › signal processing › sampling theory
shannon sampling
0.011969
On the equivalence of Kramer's and Shannon's sampling theorems (Corresp.) · IEEE Trans. Inf. Theory 1969

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

equivalence proof · 0.0
YearPublicationVenuePosition
1982 A note on sampling expansion for a transform with parabolic cylinder kernel
Abdul J. Jerri
Inf. Sci.1
1969 On the equivalence of Kramer's and Shannon's sampling theorems (Corresp.)
abstract
The question of Campbell concerning the possibility of applying Shannon's sampling theorem to the same functions that can be sampled by Kramer's generalized sampling theorem is investigated and illustrated for more functions which are solutions of second-order differential equations with singular coefficients. A few definitions are introduced and some theorems are proved to show, in a more precise way, that under certain conditions the two sampling theorems are equivalent.
Abdul J. Jerri
IEEE Trans. Inf. Theory1