View Single Post
Posts: 339 | Thanked: 1,623 times | Joined on Oct 2013 @ France
#16
Originally Posted by wicket View Post
Sorry, I didn't mean it as a judgment but as a partial explanation for why I don't have any confidence in his software products. To give you one example, if you have some idea of how parity checking works, you'll find his post here rather surprising. I could give you plenty more examples but as I said, I don't want to turn this into a systemd debate.
Surprising ?

Yeah btrfs can probably recover a lot more than a few bits (never looked at how it works), but what he is saying for "non trivial amount of errors", doesn't seem wrong, and is related to Hamming distance (https://en.wikipedia.org/wiki/Hamming_distance), and in particular things like this quote "Thus a code with minimum Hamming distance d between its codewords can detect at most d-1 errors and can correct ⌊(d-1)/2⌋ errors.".

Did I missed something obvious ?
 

The Following 5 Users Say Thank You to Zeta For This Useful Post: