Strong Data Processing Inequalities for Input Constrained Additive Noise Channels
نویسندگان
چکیده
منابع مشابه
Strong data-processing inequalities for channels and Bayesian networks
The data-processing inequality, that is, I(U ;Y ) ≤ I(U ;X) for a Markov chain U → X → Y , has been the method of choice for proving impossibility (converse) results in information theory and many other disciplines. Various channel-dependent improvements (called strong data-processing inequalities, or SDPIs) of this inequality have been proposed both classically and more recently. In this note ...
متن کاملStrong data processing inequalities and $Φ$-Sobolev inequalities for discrete channels
The noisiness of a channel can be measured by comparing suitable functionals of the input and output distributions. For instance, the worst-case ratio of output relative entropy to input relative entropy for all possible pairs of input distributions is bounded from above by unity, by the data processing theorem. However, for a fixed reference input distribution, this quantity may be strictly sm...
متن کاملWorst-case power-constrained noise for binary-input channels
The error probability and the capacity of binary-input additive-noise channels are well-known if the noise is Gaussian. A basic problem in communication theory is to find the worst-case performance achevable by any noise dlstnbutlon as a function of the signal-to-noise ratio. Thls paper gives a complete solution to this problem for the two major performance measures: error probability and capac...
متن کاملStrong Inequalities for Chance–Constrained Programming
As an essential substructure underlying a large class of chance-constrained programming problems with finite discrete distributions, the mixing set with 0 − 1 knapsack has received considerable attentions in recent literature. In this study, we present a family of strong inequalities that subsume known inequalities for this set. We also find many other inequalities that can be explained by lift...
متن کاملOptimal linear detectors for additive noise channels
We describe procedures for designing optimal and suboptimal linear detectors (discrete-time case) for additive white noise channels. We rst describe a technique for designing linear detectors based on the Wiener theory of nonlinear systems. Next, exact expressions for optimal linear detector are found when the noise amplitude's probability distribution is stable. We then describe how to computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2782359