Cart (Loading....) | Create Account
Close category search window

Linear codes for network information flow

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li, S.-Y.R. ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; Yeung, R.W.

Network information flow was recently introduced by Ahlswede et al. They studied the single-source problem. Their work revealed that it is in general not optimal to consider the information to be multicast in a network as a “fluid” which can simply be routed or replicated. Rather, by employing coding at the nodes, bandwidth can in general be saved. In this paper, we present a linear coding scheme for the single-source problem studied by Ahlswede et al. Such a coding scheme is specified by a linear-code multicast

Published in:

Information Theory and Networking Workshop, 1999

Date of Conference:


Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.