Results 11 to 20 of about 132,978 (290)
Entropy Concentration and the Empirical Coding Game [PDF]
We give a characterization of Maximum Entropy/Minimum Relative Entropy inference by providing two `strong entropy concentration' theorems. These theorems unify and generalize Jaynes' `concentration phenomenon' and Van Campenhout and Cover's `conditional ...
Cover +15 more
core +4 more sources
Fast Relative Entropy Coding with A* coding
Relative entropy coding (REC) algorithms encode a sample from a target distribution $Q$ using a proposal distribution $P$, such that the expected codelength is $\mathcal{O}(D_{KL}[Q \,||\, P])$. REC can be seamlessly integrated with existing learned compression models since, unlike entropy coding, it does not assume discrete $Q$ or $P$, and does not ...
Gergely Flamich +2 more
openaire +3 more sources
Entropy Vectors and Network Codes [PDF]
We consider a network multicast example that relates the solvability of the multicast problem with the existence of an entropy function. As a result, we provide an alternative approach to the proving of the insufficiency of linear (and abelian) network codes and demonstrate the utility of non-Shannon inequalities to tighten outer bounds on network ...
Terence Chan, Alex J. Grant
openaire +3 more sources
Prediction Method for Image Coding Quality Based on Differential Information Entropy
For the requirement of quality-based image coding, an approach to predict the quality of image coding based on differential information entropy is proposed.
Xin Tian, Tao Li, Jin-Wen Tian, Song Li
doaj +1 more source
Deterministic dense coding and entanglement entropy [PDF]
We present an analytical study of the standard two-party deterministic dense-coding protocol, under which communication of perfectly distinguishable messages takes place via a qudit from a pair of non-maximally entangled qudits in pure state |S>.
Bourdon, P. S. +3 more
core +1 more source
Lossless Image Coding Using Non-MMSE Algorithms to Calculate Linear Prediction Coefficients
This paper presents a lossless image compression method with a fast decoding time and flexible adjustment of coder parameters affecting its implementation complexity.
Grzegorz Ulacha, Mirosław Łazoryszczak
doaj +1 more source
Multiple Description Coding of Discrete Ergodic Sources [PDF]
We investigate the problem of Multiple Description (MD) coding of discrete ergodic processes. We introduce the notion of MD stationary coding, and characterize its relationship to the conventional block MD coding. In stationary coding, in addition to the
Jalali, Shirin, Weissman, Tsachy
core +2 more sources
Consumers are interested in products with functional properties that contribute to their well-being and health. An alternative source of functional ingredients would be the by-products of the citrus industry, which can be used as natural additives in ...
Luis E. Ordóñez-Santos* +2 more
doaj +1 more source
Lossy Joint Source-Channel Coding Using Raptor Codes
The straightforward application of Shannon's separation principle may entail a significant suboptimality in practical systems with limited coding delay and complexity.
O. Y. Bursalioglu +3 more
doaj +1 more source
Learning on Entropy Coded Images with CNN
We propose an empirical study to see whether learning with convolutional neural networks (CNNs) on entropy coded data is possible. First, we define spatial and semantic closeness, two key properties that we experimentally show to be necessary to guarantee the efficiency of the convolution.
Piau, Rémi +2 more
openaire +2 more sources

