2017Unpublished venueRequires access

A convolution inequality for entropy over Z2

Varun Jog

Open publisher page 0 citations

Abstract

We prove an inequality for the entropy of a sum of two independent random variables taking values in the group ℤ2. Our inequality is very simply stated, and may be interpreted as a lower bound on the capacity of a cascade of two BSC channels in terms of the capacities of the component BSC channels. The inequality provides an upper bound on the entropy of a sum of two ℤ2-valued random variables, and thus it may also be thought of as a reverse entropy power inequality. One of the intriguing features of this inequality is that it only holds if entropy is measured in bits; i.e., the base with respect to which logarithms are taken matters crucially.

About this research paper

What this paper is about

We prove an inequality for the entropy of a sum of two independent random variables taking values in the group ℤ2. Our inequality is very simply stated, and may be interpreted as a lower bound on the capacity of a cascade of two BSC channels in terms of the capacities of the component BSC channels. The inequality provides an upper bound on the entropy of a sum of two ℤ2-valued random variables, and thus it may also be thought of as a reverse entropy power inequality. One of the intriguing features of this inequality is that it only holds if entropy is measured in bits; i.e., the base with respect to which logarithms are taken matters crucially.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We prove an inequality for the entropy of a sum of two independent random variables taking values in the group ℤ2. Our inequality is very simply stated, and may be interpreted as a lower bound on the capacity of a cascade of two BSC channels in terms of the capacities of the component BSC channels. The inequality provides an upper bound on the entropy of a sum of two ℤ2-valued random variables, and thus it may also be thought of as a reverse entropy power inequality. One of the intriguing features of this inequality is that it only holds if entropy is measured in bits; i.e., the base with respect to which logarithms are taken matters crucially.

Key concepts: Mathematics, Inequality, Entropy (arrow of time), Entropy power inequality, Upper and lower bounds, Random variable, Logarithm, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A convolution inequality for entropy over Z2 — Research Paper | ScholarLens