A recursive construction of the set of binary entropy vectors

Authors:
John MacLaren Walsh;Steven Weber
Affiliations:
Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA;Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 5
Cited 0

Information Theory and Network Coding

Information Theory and Network Coding
A non-Shannon-type conditional inequality of information quantities

IEEE Transactions on Information Theory
On characterization of entropy function via information inequalities

IEEE Transactions on Information Theory
Constructing free-energy approximations and generalized belief propagation algorithms

IEEE Transactions on Information Theory
Networks, Matroids, and Non-Shannon Information Inequalities

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The primary contribution is a finite terminating algorithm that determines membership of a candidate entropy vector in the set of binary entropy vectors φN. We outline the relationship between φN and its unbounded cardinality discrete random variable counterpart Γ*N (or its normalization Ω*N). We discuss connections between φN and Ω*N). For example, for any outer bound, say the Shannon outer bound PN, to Ω*N, we provide a finite terminating algorithm to find a polytopic inner bound on Ω*N that agrees on tight faces of the outer bound.