A proof of the Fisher information inequality via a data processing argument (Q4400347)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1182112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proof of the Fisher information inequality via a data processing argument |
scientific article; zbMATH DE number 1182112 |
Statements
A proof of the Fisher information inequality via a data processing argument (English)
0 references
29 November 1998
0 references
Cramer-Rao bound
0 references
entropy-power inequality
0 references
Fisher information
0 references
linear modeling
0 references
non-Gaussian noise
0 references
prefiltering
0 references
data-processing inequality
0 references
0.7719273567199707
0 references
0.7387416362762451
0 references
0.7362058758735657
0 references
0.7353798151016235
0 references
