Computer aided proofs for rate regions of independent distributed source coding problems | IEEE Conference Publication | IEEE Xplore

Computer aided proofs for rate regions of independent distributed source coding problems


Abstract:

The rate regions of independent distributed source coding (IDSC) problems, a sub-class of the broader family of multi-source multi-sink networks, are investigated. An IDS...Show More

Abstract:

The rate regions of independent distributed source coding (IDSC) problems, a sub-class of the broader family of multi-source multi-sink networks, are investigated. An IDSC problem consists of multiple sources, multiple encoders, and multiple decoders, where each encoder has access to all sources, and each decoder has access to a certain subset of the encoders and demands a certain subset of the sources. Instead of manually deriving the rate region for a particular problem, computer tools are used to obtain the rate regions for hundreds of nonisomorphic (symmetry-removed) IDSC instances. A method for enumerating all non-isomorphic IDSC instances of a particular size is given. For each non-isomorphic IDSC instance, the Shannon outer bound, superposition coding inner bound, and several achievable inner bounds based on linear codes, are considered and calculated. For all of the hundreds of IDSC instances considered, vector binary inner bounds match the Shannon outer bound, and hence, exact rate regions are proven together with code constructions that achieve them.
Date of Conference: 22-24 June 2015
Date Added to IEEE Xplore: 06 August 2015
Electronic ISBN:978-1-4799-1911-6
Print ISSN: 2374-9660
Conference Location: Sydney, NSW, Australia

References

References is not available for this document.