作者: Congduan Li , Steven Weber , John Maclaren Walsh
DOI: 10.1109/NETCOD.2015.7176794
关键词:
摘要: The rate regions of independent distributed source coding (IDSC) problems, a sub-class the broader family multi-source multi-sink networks, are investigated. An IDSC problem consists multiple sources, encoders, and decoders, where each encoder has access to all decoder certain subset encoders demands sources. Instead manually deriving region for particular problem, computer tools used obtain hundreds nonisomorphic (symmetry-removed) instances. A method enumerating non-isomorphic instances size is given. For instance, Shannon outer bound, superposition inner several achievable bounds based on linear codes, considered calculated. considered, vector binary match hence, exact proven together with code constructions that achieve them.