average to recreate O(N) data blocks. Each of the coded blocks has the same size as
a data block plus a tiny bit of bookkeeping info (e.g . block number).
Check out the papers on Tornado codes.
Bob.
On 7/25/06, Jim Dixon <[EMAIL PROTECTED]
> wrote:
On Tue, 25 Jul 2006, Marcelo Iury Oliveira / Projeto Ourgrid wrote:
> The key property of erasure code is that the original object can be
> reconstructed from any b out of the m encoded block.
> Is it true that the combined size of the b block is equal to the
> original object size?
Depends, doesn't it?
However, if the original object is incompressible, it's simple enough:
each of the m blocks must carry additional bookkeeping information
to enable the recipient to figure out how to recreate the original.
Therefore the aggregate size must exceed the size of that original object.
--
Jim Dixon [EMAIL PROTECTED] tel +44 117 982 0786 mobile +44 797 373 7881
http://xlattice.sourceforge.net p2p communications infrastructure
_______________________________________________
p2p-hackers mailing list
[email protected]
http://lists.zooko.com/mailman/listinfo/p2p-hackers
_______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
