Coding Schemes for Line Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in the proceedings of the 2005 IEEE international Symposium on Information Theory, Adelaide, Australia, Sept. 4-9, 2

Scientific paper

We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose coding schemes for this setting, and discuss each scheme in terms of complexity, delay, achievable rate, memory requirement, and adaptability to unknown channel parameters. We also briefly discuss how these schemes can be extended to more general networks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Coding Schemes for Line Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coding Schemes for Line Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding Schemes for Line Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-404917

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.