It seems intuitive to me that less efficient data storage methods are also less susceptible to degradation over time.

For instance, the string "ABC" can also be represented as "AAABBBCCC." In the first string, if you randomly change one letter into any other letter, the original string can't be constructed. In the second, more redundant representation, if you do the same thing the original string is still constructible. The second string is less volatile.

What I'm looking for is a theorem or paper that explains this effect. Is efficiency really correlated with volatility like this, or am I missing something?

  • 1
    $\begingroup$ The fact that redundant storage allows reconstructing values is quite obvious, I don't think you fill find any papers about this. However, there is plenty of research on how one can maximize 'resilience' with a minimum of redundancy, for a starting point have a look at Gray Code. $\endgroup$ – TilmannZ Aug 2 '20 at 11:25

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.