A Recursive Construction of the Set of Binary Entropy Vectors and Related Algorithmic Inner Bounds for the Entropy Region | IEEE Journals & Magazine | IEEE Xplore
Subscribe
ADVANCED SEARCH
Journals & Magazines >IEEE Transactions on Informat... >Volume: 57 Issue: 10

A Recursive Construction of the Set of Binary Entropy Vectors and Related Algorithmic Inner Bounds for the Entropy Region

PDF
John MacLaren Walsh; Steven Weber
All Authors

Abstract:

A method for checking membership in the region of entropic vectors generated from N bits is presented. A general technique for utilizing this method to create inner bound...Show More

Metadata

Abstract:

A method for checking membership in the region of entropic vectors generated from N bits is presented. A general technique for utilizing this method to create inner bounds for regions of entropic vectors as a function of outer bounds is then presented. These two algorithms are then used to provide new insights regarding relationships among well known bounds for the region of entropic vectors..
Published in: IEEE Transactions on Information Theory ( Volume: 57, Issue: 10, October 2011)
Page(s): 6356 - 6363
Date of Publication: 06 October 2011

ISSN Information:

DOI: 10.1109/TIT.2011.2165817
Contents
Contact IEEE to Subscribe

References

References is not available for this document.

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.