Noiseless Coding for Multiple Channels
Joven Dj Golic · International Symposium on Information Theory and its Applications · 1994
Noiseless coding for parallel channels of finite or countably infinite stationary ergodic sources is considered from the entropy/equivocation standpoint. The corresponding achievable rate-entropy regions are determined for two and three channels. For an arbitrary number of channels, some necessary and sufficient achievability conditions are derived and a general solution is conjectured, which essentially claims that an arbitrary poly-matroidal structure of joint entropies is achievable. Relations to multiple description schemes, secret sharing schemes, and secret sharing communication systems are also discussed.