Conference proceeding
A Recursive Construction of the Set of Binary Entropy Vectors
2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, pp 545-552
01 Jan 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 Phi(N). We outline the relationship between Phi(N) and its unbounded cardinality discrete random variable counterpart (Gamma) over bar*(N) (or its normalization (Omega) over bar*(N)). We discuss connections between Phi(N) and (Omega) over bar*(N). For example, for any outer bound, say the Shannon outer bound P-N, to (Omega) over bar*(N), we provide a finite terminating algorithm to find a polytopic inner bound on (Omega) over bar*(N) that agrees on tight faces of the outer bound.
Metrics
Details
- Title
- A Recursive Construction of the Set of Binary Entropy Vectors
- Creators
- John MacLaren Walsh - Drexel UniversitySteven Weber - Drexel UniversityIEEE
- Publication Details
- 2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, pp 545-552
- Conference
- 2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, 47th
- Series
- Annual Allerton Conference on Communication Control and Computing
- Publisher
- IEEE
- Number of pages
- 8
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Web of Science ID
- WOS:000279627100074
- Scopus ID
- 2-s2.0-77949637544
- Other Identifier
- 991019167416504721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Theory & Methods
- Engineering, Electrical & Electronic
- Telecommunications