An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
An outer bound for multisource multisink network coding with minimum cost consideration
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding theory part II: multiple source
Communications and Information Theory
Network coding theory: single sources
Communications and Information Theory
An overview of network coding for dynamically changing networks
International Journal of Autonomous and Adaptive Communications Systems
Error propagation mitigation for wireless network coding
International Journal of Autonomous and Adaptive Communications Systems
Smoke and mirrors: reflecting files at a geographically remote location without loss of performance
FAST '09 Proccedings of the 7th conference on File and storage technologies
On the multicast throughput capacity of network coding in wireless ad-hoc networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Multicast throughput order of network coding in wireless ad-hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
FPGA implementation of highly parallelized decoder logic for network coding (abstract only)
Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays
Coding-aware routing for unicast sessions in wireless networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A joint interchannel and network coding schema for nVoD services over wireless mesh networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Network coding does not change the multicast throughput order of wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Variable-rate linear network coding
IEEE Transactions on Information Theory
Quantum network communication: the butterfly and beyond
IEEE Transactions on Information Theory
Joint NC-ARQ and AMC for QoS-guaranteed mobile multicast
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Linear index coding via semidefinite programming
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Design and evaluation of random linear network coding Accelerators on FPGAs
ACM Transactions on Embedded Computing Systems (TECS)
Reconfigurable and parallelized network coding decoder for VANETs
Mobile Information Systems
Hi-index | 754.96 |
Inspired by mobile satellite communications systems, we consider a source coding system which consists of multiple sources, multiple encoders, and multiple decoders. Each encoder has access to a certain subset of the sources, each decoder has access to certain subset of the encoders, and each decoder reconstructs a certain subset of the sources almost perfectly. The connectivity between the sources and the encoders, the connectivity between the encoders and the decoders, and the reconstruction requirements for the decoders are all arbitrary. Our goal is to characterize the admissible coding rate region. Despite the generality of the problem, we have developed an approach which enables us to study all cases on the same footing. We obtain inner and outer bounds of the admissible coding rate region in terms of ΓN * and Γ¯N*, respectively, which are fundamental regions in the entropy space defined by Yeung (1991). So far, there has not been a full characterization of ΓN*, so these bounds cannot be evaluated explicitly except for some special cases. Nevertheless, we obtain an alternative outer bound which can be evaluated explicitly. We show that this bound is tight for all the special cases for which the admissible coding rate region is known. The model we study in this paper is more general than all previously reported models on multilevel diversity coding, and the tools we use are new in multiuser information theory