Fixed content distributed data storage using permutation ring encoding

In a redundant array of independent nodes, wherein a data file comprising a set of N data blocks A1, . . . , An are stored in N respective nodes of the array, a method of protecting the data file against loss of data, comprising:

• storing K code blocks in K respective nodes of the array, distinct from the N respective nodes, wherein each code block has an ith code block computed as:
• Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations.

A process for protecting against loss and for enhancing accessibility in storage or memory, or protecting against loss and enhancing speed of transmission on communication paths, of information that is represented in storage or memory, or represented as data signals on communication paths, the information comprising N data blocks A1, . . . , An, comprising:

• dispersing the information by transmitting the N data blocks in the form of said data signals carried on multiple first communication paths, or by storing the N data blocks in N storage or memory locations;
• dispersing protection information by transmitting K code blocks in the form of data signals carried on multiple second communication paths distinct from the multiple first communications paths, or by storing the K code blocks in K storage or memory locations distinct from the N storage or memory locations, wherein each code block has an ith code block computed as:
• Ci=f(gi1(A1), . . . gin(An)), where each g is a permutation operator that comprises a superposition of cyclic permutations.