English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the differential entropy rate of such a process and the differential entropy rate of a Gaussian process with the same autocovariance function is bounded. This result is based on a recent result on bounding the Kullback-Leibler divergence by the Wasserstein distance given by Polyanskiy and Wu. Moreover, it is related to the famous hyperplane conjecture, also known as slicing problem, in convex geometry originally stated by J. Bourgain. Based on an entropic formulation of the hyperplane conjecture given by Bobkov and Madiman we discuss the relation of our result to the hyperplane conjecture.

A lower bound on the entropy rate for a large class of stationary processes and its relation to the hyperplane conjecture