A random coding theorem for "modulo-two adder" source network

Details A random coding theorem for "modulo-two adder" source network A random coding theorem for "modulo-two adder" source network

2008-11-05

arxiv.org/abs/0811.0777v2

Computer Science

Information Theory

This paper has been withdrawn

Scientific paper

This paper has been withdrawn by the author, due a crucial error in the proof of the main Theorem (Sec. 3). In particular, in deriving the bound on the probability of error (Eq. 10) the contribution of those pairs (x', y') that are not equal to (x, y) has not been considered. By adding the contribution of these pairs, one can verify that a region of rates similar to the Slepian-Wolf region will emerge. The author would like to acknowledge a critical review of the paper by Mr. Paul Cuff of Stanford University who first pointed out the error.

Affiliated with

Also associated with

No associations

Rating

A random coding theorem for "modulo-two adder" source network 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 A random coding theorem for "modulo-two adder" source network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A random coding theorem for "modulo-two adder" source network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-629945