2014•Unpublished venueRequires access

New Bounds of a Measure in Information Theory

Mihaela Alexandra Popescu, Oana Slușanschi, Alexandru Corneliu Olteanu, Florin Pop

Abstract

Shannon Entropy, for discrete-valued random variables, plays an important roles in information theory, with applicability in cryptography and communication theory. The purpose of this paper is to present a new bound for the Shannon Entropy. For this we first present a refinement of Jensen's inequality.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Key concepts: Information theory, Entropy power inequality, Information diagram, Entropy (arrow of time), Shannon's source coding theorem, Cryptography, Computer science, Measure (data warehouse)