Separate network coding for private and common messages from one source to two sinks

Authors:
Kunihiko Harada;Hirosuke Yamamoto
Affiliations:
Department of Mathematical Informatics, The University of Tokyo, Bunkyo-Tu, Tokyo, Japan;Department of Complexity Science and Engineering, The University of Tokyo, Kashiwa-shi, Chiba, Japan
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 5
Cited 0

Construction Algorithm for Network Error-Correcting Codes Attaining the Singleton Bound

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Strongly Secure Linear Network Coding

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ngai-Yeung and Erez-Feder independently derived the capacity region of network coding with a single source and two sinks, in which a common message is sent from the source to both sinks but each private message is sent to only the corresponding sink. In this paper, it is shown that the above capacity region can be achieved by separate linear coding such that three routes of private and common messages are perfectly separated. This means that each private message can be sent to the corresponding sink only by routing while the common message can be sent to both sinks by a relatively simple multicast linear network code.