Hi Paul,
thank you for your message
from my point, LRC focuses on the repairing problem. how to reconstruct
destroyed node to maintain the same availability by the distributed system?
in this context they can even go below 1x rate by introducing local
parity on classical Reed Solomon blocks (but they pay a supplementary
overhead). see excellent Alex Dimakis's papers for that. but, still from
my point, the same relationship between redundancy and availability
occurs (if you consider binomial model for your loses).
best
bp
Le 17/06/2013 18:55, Paul Von-Stamwitz a écrit :
Loic,
As Benoit points out, Mojette uses discrete geometry rather than algebra, so simple XOR is all that is needed.
Benoit,
Microsoft's paper states that their [12,2,2] LRC provides better availability than 3x replication with 1.33x efficiency. 1.5x is certainly a good number. I'm just pointing out that better efficiency can be had without losing availibity.
All the best,
Paul
begin:vcard
fn;quoted-printable:Beno=C3=AEt Parrein
n;quoted-printable:Parrein;Beno=C3=AEt
org;quoted-printable:Polytech Nantes, Universit=C3=A9 de Nantes, IRCCyN lab
adr;quoted-printable:;;=C3=A9quipe Image Vid=C3=A9o Communication;;;;France
email;internet:benoit.parrein@xxxxxxxxxxxxxxxxxxxxxxx
title;quoted-printable:Ma=C3=AEtre de Conf=C3=A9rences
tel;work:+33 2 40 68 30 50
version:2.1
end:vcard
