Improved compression of network coding vectors using erasure decoding and list decoding

Details Improved compression of network coding vectors using erasure decoding and list decoding Improved compression of network coding vectors using erasure decoding and list decoding

2010-06-01

arxiv.org/abs/1006.0245v1

Computer Science

Information Theory

3 pages. Accepted by IEEE Communications Letters. First submitted: 18-Sep-2009

Scientific paper

Practical random network coding based schemes for multicast include a header in each packet that records the transformation between the sources and the terminal. The header introduces an overhead that can be significant in certain scenarios. In previous work, parity check matrices of error control codes along with error decoding were used to reduce this overhead. In this work we propose novel packet formats that allow us to use erasure decoding and list decoding. Both schemes have a smaller overhead compared to the error decoding based scheme, when the number of sources combined in a packet is not too small.

Affiliated with

Also associated with

No associations

Rating

Improved compression of network coding vectors using erasure decoding and list decoding 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 Improved compression of network coding vectors using erasure decoding and list decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved compression of network coding vectors using erasure decoding and list decoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511990