Previous Page 8

Displaying 141 – 159 of 159

Showing per page

The sum-product algorithm: algebraic independence and computational aspects

Francesco M. Malvestuto (2013)

Kybernetika

The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of probability-theoretic...

Violations of the Ingleton inequality and revising the four-atom conjecture

Nigel Boston, Ting-Ting Nan (2020)

Kybernetika

The entropy region is a fundamental object of study in mathematics, statistics, and information theory. On the one hand, it involves pure group theory, governing inequalities satisfied by subgroup indices, whereas on the other hand, computing network coding capacities amounts to a convex optimization over this region. In the case of four random variables, the points in the region that satisfy the Ingleton inequality (corresponding to abelian groups and to linear network codes) form a well-understood...

Currently displaying 141 – 159 of 159

Previous Page 8