METHOD FOR DATA RECOVERY
First Claim
1. A method for encoding multiple data symbols, the method comprising:
- receiving or calculating, by a computerized system, multiple (k) input data symbols;
wherein the multiple input data symbols belong to a finite field F of order q;
q being a positive integer;
mapping the multiple input data symbols, by an injective mapping function, to a set of encoding polynomials;
wherein the set of encoding polynomials comprises at least one encoding polynomial; and
constructing a plurality (n) of encoded symbols that form multiple (t) recovery sets by evaluating the set of encoding polynomials at points of pairwise disjoint subsets (A1, . . . , At) of the finite field F;
wherein each recovery set is associated with one of the pairwise disjoint subsets of the finite field F.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for encoding multiple data symbols, the method may include receiving or calculating, by a computerized system, multiple (k) input data symbols; wherein the multiple input data symbols belong to a finite field F of order q; q being a positive integer that may exceed n; mapping the multiple input data symbols, by an injective mapping function, to a set of encoding polynomials; wherein the set of encoding polynomials comprises at least one encoding polynomial; and constructing a plurality (n) of encoded symbols that form multiple (t) recovery sets by evaluating the set of encoding polynomials at points of pairwise disjoint subsets (A1, . . . , At) of the finite field F; wherein each recovery set is associated with one of the pairwise disjoint subsets of the finite field F.
-
Citations
30 Claims
-
1. A method for encoding multiple data symbols, the method comprising:
-
receiving or calculating, by a computerized system, multiple (k) input data symbols;
wherein the multiple input data symbols belong to a finite field F of order q;
q being a positive integer;mapping the multiple input data symbols, by an injective mapping function, to a set of encoding polynomials;
wherein the set of encoding polynomials comprises at least one encoding polynomial; andconstructing a plurality (n) of encoded symbols that form multiple (t) recovery sets by evaluating the set of encoding polynomials at points of pairwise disjoint subsets (A1, . . . , At) of the finite field F;
wherein each recovery set is associated with one of the pairwise disjoint subsets of the finite field F. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A method for encoding multiple data symbols, the method comprising:
- receiving or calculating, by a computerized system, multiple (k) input data symbols;
wherein the multiple symbols belongs to a finite field F; and
processing, by the computerized system, the multiple symbols using a Chinese Remainder Theorem algorithm to provide a plurality (n) of encoded symbols that form multiple (t) recovery sets;
wherein each of the recovery set is associated with a pairwise disjoint subset of the finite field F. - View Dependent Claims (22, 23, 24, 25, 26, 27)
- receiving or calculating, by a computerized system, multiple (k) input data symbols;
-
28. A method for encoding multiple data symbols that belong to a finite field F, the method comprising:
-
receiving or calculating, by a computerized system, multiple (k) input data symbols;
wherein the multiple input data symbols belong to a finite field F of order q;processing the multiple (k) data symbols to provide multiple (n) encoded data symbols that form multiple (t) recovery sets; and reconstructing a failed encoded symbol of the multiple (n) encoded data symbols; wherein the reconstructing comprises attempting to reconstruct the failed encoded symbol by utilizing non-failed encoded symbols of at least two recovery sets that are associated with the failed encoded symbol;
wherein the at least two recovery sets belong to the multiple recovery sets. - View Dependent Claims (29, 30)
-
Specification