اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn improved estimate of the inverse binary entropy function
53
0
0.0
(
0
)
تأليف
Reginald D. Smith
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Two estimates for the inverse binary entropy function are derived using the property of information entropy to estimate combinatorics of sequences as well as related formulas from population genetics for the effective number of alleles. The second estimate shows close correspondence to the actual value of the inverse binary entropy function and can be seen as a close approximation away from low values of binary entropy where $p$ or $1-p$ are small.
قيم البحث
اقرأ أيضاً
The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {em target function}, of which the inputs are generated at multiple source
nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The {em computing rate} of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network. In this paper, we obtain an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. This improved upper bound not only is an enhancement of the previous upper bounds but also is the first tight upper bound on the computing capacity for computing an arithmetic sum over a certain non-tree network, which has been widely studied in the literature. We also introduce a multi-dimensional array approach that facilitates evaluation of the improved upper bound. Furthermore, we apply this bound to the problem of computing a vector-linear function over a network. With this bound, we are able to not only enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable. This result establishes that in general our improved upper bound is non achievable, but whether it is asymptotically achievable or not remains open.
Recently, Samorodnitsky proved a strengthened version of Mrs. Gerbers Lemma, where the output entropy of a binary symmetric channel is bounded in terms of the average entropy of the input projected on a random subset of coordinates. Here, this result
is applied for deriving novel lower bounds on the entropy rate of binary hidden Markov processes. For symmetric underlying Markov processes, our bound improves upon the best known bound in the very noisy regime. The nonsymmetric case is also considered, and explicit bounds are derived for Markov processes that satisfy the $(1,infty)$-RLL constraint.
In the paper, the approximate sequence for entropy of some binary hidden Markov models has been found to have two bound sequences, the low bound sequence and the upper bound sequence. The error bias of the approximate sequence is bound by a geometric
sequence with a scale factor less than 1 which decreases quickly to zero. It helps to understand the convergence of entropy rate of generic hidden Markov models, and it provides a theoretical base for estimating the entropy rate of some hidden Markov models at any accuracy.
The hypothesis of the conserved vector current, relating the vector weak and isovector electromagnetic currents, plays a fundamental role in quantitative description of neutrino interactions. Despite being experimentally confirmed with great precisio
n, it is not fully implemented in existing calculations of the cross section for inverse beta decay, the dominant mechanism of antineutrino scattering at energies below a few tens of MeV. In this article, I estimate the corresponding cross section and its uncertainty, ensuring conservation of the vector current. While converging to previous calculations at energies of several MeV, the obtained result is appreciably lower and predicts more directional positron production near the reaction threshold. These findings suggest that in the current estimate of the flux of geologically produced antineutrinos the 232Th and 238U components may be underestimated by 6.1 and 3.7%, respectively. The proposed search for light sterile neutrinos using a 144Ce--144Pr source is predicted to collect the total event rate lower by 3% than previously estimated and to observe a spectral distortion that could be misinterpreted as an oscillation signal. In reactor-antineutrino experiments, together with a re-evaluation of the positron spectra, the predicted event rate should be reduced by 0.9%, diminishing the size of the reported anomaly.
Using a sharp version of the reverse Young inequality, and a Renyi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive Renyi entropy power inequalities for log-concave random vectors when Renyi parameters bel
ong to $(0,1)$. Furthermore, the estimates are shown to be sharp up to absolute constants.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
