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

Jerzy Seidler

dblp:23/3727 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1975
—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
Information theory · 96% Coding theory · 4%

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

TopicWeightPapersLastEvidence papers
Information theory › statistical inference
detection and estimation
0.011975
A Method of Analysis of Discrete Communication Feedback Systems · Inf. Control. 1975
Information theory
estimation theory
0.011971
Bounds on the mean-square error and the quality of domain decisions based on mutual information · IEEE Trans. Inf. Theory 1971
Information theory › estimation theory › estimation bounds
mean-square error bounds
0.011971
Bounds on the mean-square error and the quality of domain decisions based on mutual information · IEEE Trans. Inf. Theory 1971
Information theory › information measures › mutual information
mutual information bound
0.011971
Bounds on the mean-square error and the quality of domain decisions based on mutual information · IEEE Trans. Inf. Theory 1971
Coding theory › channel coding
error probability bounds
0.011971
Bounds on the mean-square error and the quality of domain decisions based on mutual information · IEEE Trans. Inf. Theory 1971
Information theory
hypothesis testing
0.011971
Bounds on the mean-square error and the quality of domain decisions based on mutual information · IEEE Trans. Inf. Theory 1971

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

feedback analysis · 0.0fano bound · 0.0cramér-rao bound · 0.0
YearPublicationVenuePosition
1975 A Method of Analysis of Discrete Communication Feedback Systems
Jerzy Seidler
Inf. Control.1
1971 Bounds on the mean-square error and the quality of domain decisions based on mutual information
abstract
A class of lower bounds for the generalized mean-square error (MSE), the probability of error, and the accuracy of domain decisions is derived. The derivation is based on the well-known properties of the functional \begin{equation} \Lambda \equiv \int _ {\mathcal{H}} - [\ln p_2 (x) - \ln p_1 (x)]p_1(x)d \gamma. \end{equation} The bounds depend on the mutual information between the channel's input and output signals and on the loss of information due to making the decision. It is shown that further bounding of mutual information gives as special cases bounds for the generalized MSE. These special cases almost coincide with a special case of the we!l-known Shannon bound, which is based on information rate relative to a fidelity criterion, and with a special case of the Cramér-Rao bound. The derived bound for the probability of error and the accuracy is valid both in the continuous case, in particular for interval decisions and in the discrete case for list decisions. In another special case the bound turns out to be the well-known Fano bound. The problem of the uniqueness of the derived bounds is also considered and it is shown that in a certain sense they are unique bounds based only on mutual information. As by-products a new extremal property of the entropy and a uniqueness property of functional\Lambdaare proved.
Jerzy Seidler
IEEE Trans. Inf. Theory1