Create your own erasure code
hackthe.computer
Create your own erasure code
1–10 of 11 posts
Re: Create your own erasure code
#2Good heavens, Fixedsys as a webfont.
Re: Create your own erasure code
#3Good heavens, Fixedsys as a webfont.
Also .computer
Re: Create your own erasure code
#4What if the three points are colinear? Do we assume a straight line polynomial?
Re: Create your own erasure code
#5What if the three points are colinear? Do we assume a straight line polynomial?
Yes. If you have a "parabola" with 3 colinear points, your parabola is a straight line.
Re: Create your own erasure code
#6Re: Create your own erasure code
#7This post made me listen to erasure. Thank you.
Also, sorry for the OT.
Re: Create your own erasure code
#8What if the parity bytes exceed 255? I'm assuming this is done with modular arithmetic, but does mod math work to recover missing data from the parity bits without trial and error? (i.e. is the recovery function a one-to-one mapping in reverse?)
I'm not well-versed in modular arithmetic, so excuse me if the answer is obvious to those that are.
Re: Create your own erasure code
#9What if the parity bytes exceed 255? I'm assuming this is done with modular arithmetic, but does mod math work to recover missing data from the parity bits without trial and error? (i.e. is the recovery function a one-to-one mapping in reverse?) I'm not well-versed in modular arithmetic, so excuse me if the answer is obvious to those that are.
For this particular case, this is not done using modular arithmetic. The parity values are simply rational - they might be fractional, negative, larger than 255, etc.
This erasure code is not at all optimal; it only serves to teach the basics of how one could work. In practice you'll definitely want a Galois Field or something.
Re: Create your own erasure code
#10What if the parity bytes exceed 255? I'm assuming this is done with modular arithmetic, but does mod math work to recover missing data from the parity bits without trial and error? (i.e. is the recovery function a one-to-one mapping in reverse?) I'm not well-versed in modular arithmetic, so excuse me if the answer is obvious to those that are.
For this particular case, this is not done using modular arithmetic. The parity values are simply rational - they might be fractional, negative, larger than 255, etc. This erasure code is not at all optimal; it only serves to teach the basics of how one could work. In practice you'll definitely want a Galois Field or something.
Pardon my ignorance, but how would a system using a Galois Field work? All this stuff is really interesting to me.