Title :
Computer aided proofs for rate regions of independent distributed source coding problems
Author :
Congduan Li ; Weber, Steven ; Walsh, John MacLaren
Author_Institution :
ECE Dept., Drexel Univ., Philadelphia, PA, USA
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.
Keywords :
binary codes; decoding; linear codes; source coding; IDSC problem; Shannon outer bound; computer tool; independent distributed source coding problems rate region; linear code; multiple decoder; multisource multisink network; superposition coding inner bound; vector binary inner bound match; Binary codes; Channel coding; Computers; Decoding; Network coding; Source coding;
Conference_Titel :
Network Coding (NetCod), 2015 International Symposium on
Conference_Location :
Sydney, NSW
DOI :
10.1109/NETCOD.2015.7176794