By Topic

A computational approach for determining rate regions and codes using entropic vector bounds

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Congduan Li ; Drexel University, Dept. of ECE, Philadelphia, PA 19104, USA ; John MacLaren Walsh ; Steven Weber

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.

Published in:

Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on

Date of Conference:

1-5 Oct. 2012