Title :
A recursive construction of the set of binary entropy vectors
Author :
Walsh, John MacLaren ; Weber, Steven
Author_Institution :
Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA
fDate :
Sept. 30 2009-Oct. 2 2009
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.
Keywords :
information theory; recursive estimation; source coding; binary entropy vectors; finite terminating algorithm; recursive construction; unbounded cardinality discrete random variable counterpart; Constraint theory; Delta modulation; Entropy; Helium; Information theory; Network coding; Random variables; Source coding; Stacking;
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394909