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

Lawrence P. Seidman

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

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

Theory of computation · 2 · 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
2 papers
Information theory · 78% Mathematical optimization · 22%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory
estimation theory
0.021969
A useful form of the Barankin lower bound and its application to PPM threshold analysis · IEEE Trans. Inf. Theory 1969
An upper bound on average estimation error in nonlinear systems · IEEE Trans. Inf. Theory 1968
Information theory › estimation theory › estimation bounds
barankin bound
0.011969
A useful form of the Barankin lower bound and its application to PPM threshold analysis · IEEE Trans. Inf. Theory 1969
Information theory › estimation theory › estimation bounds
estimation error bounds
0.011968
An upper bound on average estimation error in nonlinear systems · IEEE Trans. Inf. Theory 1968
Mathematical optimization › statistical estimation › point estimation
nonlinear estimation
0.011968
An upper bound on average estimation error in nonlinear systems · IEEE Trans. Inf. Theory 1968
Physical-layer communications › modulation
pulse position modulation
0.011969
A useful form of the Barankin lower bound and its application to PPM threshold analysis · IEEE Trans. Inf. Theory 1969
Physical-layer communications
signal processing for communications
0.011969
A useful form of the Barankin lower bound and its application to PPM threshold analysis · IEEE Trans. Inf. Theory 1969
Information theory
hypothesis testing
0.011968
An upper bound on average estimation error in nonlinear systems · IEEE Trans. Inf. Theory 1968
Mathematical optimization › statistical estimation
maximum likelihood estimation
0.011968
An upper bound on average estimation error in nonlinear systems · IEEE Trans. Inf. Theory 1968
YearPublicationVenuePosition
1969 A useful form of the Barankin lower bound and its application to PPM threshold analysis
abstract
A form of Barankin's greatest lower bound on estimation error [7] is obtained, which is easy to compute and easy to interpret. This gives a lower bound on estimation error for non-linear modulation systems in an additive Gaussian noise back-ground. Threshold effects are included. This bound is applied to a set of pulse-position modulation waveforms designed to reduce threshold effects. It is shown that these signals do, in fact, offer reduced threshold levels (e.g.,\approx 3.5dB) with very small (\approx \frac{1}{2}dB) degradation in large signal performance.
Robert J. McAulay, Lawrence P. Seidman
IEEE Trans. Inf. Theory2
1968 An upper bound on average estimation error in nonlinear systems
abstract
An upper bound is obtained on the probability density of the estimate of the parametermwhen a nonlinear functions(t, m)is transmitted over a channel that adds Gaussian noise, and maximum likelihood or maximum a posteriori estimation is used. If this bound is integrated with a loss function, an upper bound on the average error is obtained. Nonlinear (below threshold) effects are included. The problem is viewed in a Euclidean space. Evaluation of the probability density can be reduced to integrating the probability density of the observation over part of a hyperplane. By bounding the integrand, and using a larger part of the hyperplane, an upper bound is obtained. The resulting bound on mean-square error is quite close for the cases calculated.
Lawrence P. Seidman
IEEE Trans. Inf. Theory1