Hi, All. I've been playing around with Online Codes, which are awesome. I have a question about recovering composite message blocks from check blocks. I often encounter the case where an incoming check block is composed entirely of known composite message blocks. I expect this to happen, given the pseudorandom nature of the way composite message blocks are selected during the encoding process. But is the algorithm supposed to address this in some way?
I guess my question is, should I go back and look for bugs in my implementation, or should I tune the encoding parameters to minimize the number of these "useless" blocks? For instance, when my message size is 1Mb and my composite block size is 8Kb, I receive no "useless" blocks. But when my message size is 128Mb and my block size is 256bytes, I receive roughly 316,000 useless blocks, or 36.8% of the message. Thanks, Russ _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
