Conference proceeding
A computational approach for determining rate regions and codes using entropic vector bounds
2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), pp 1580-1587
01 Jan 2012
Abstract
A computational technique for determining rate regions for networks and multilevel diversity coding systems based on inner and outer bounds for the region of entropic vectors is discussed. The expression to get rate region in terms of region of entropic vectors is attributed to Yeung and Zhang. An inner bound based on binary representable matroids is discussed that has the added benefit of identifying optimal linear codes. The theorem stated by Hassibi et al. in 2010 ITA is implemented to get H-representation of binary matroid inner bound for more than 4 variables. The computational technique is demonstrated on a series of small examples of multilevel diversity coding systems.
Metrics
Details
- Title
- A computational approach for determining rate regions and codes using entropic vector bounds
- Creators
- Congduan Li - Drexel UniversityJohn MacLaren Walsh - Drexel UniversitySteven Weber - Drexel UniversityIEEE
- Publication Details
- 2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), pp 1580-1587
- Conference
- 2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 50th
- 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:000320654000218
- Scopus ID
- 2-s2.0-84875723663
- Other Identifier
- 991019170321904721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Automation & Control Systems
- Computer Science, Theory & Methods
- Engineering, Electrical & Electronic
- Telecommunications