Patents by Inventor Itzhak Tamo

Itzhak Tamo has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20240321356
    Abstract: Methods of storing information in a living organism are provided. Systems and computer program products for performing the methods are also provided.
    Type: Application
    Filed: June 4, 2024
    Publication date: September 26, 2024
    Inventors: Tamir TULLER, Itzhak TAMO, Alon AKIVA
  • Publication number: 20150095747
    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.
    Type: Application
    Filed: September 29, 2014
    Publication date: April 2, 2015
    Inventors: Itzhak Tamo, Alexander Barg
  • Patent number: 8694866
    Abstract: MDS (maximum distance separable) array codes are widely used in storage systems to protect data against erasures. The rebuilding ratio problem is addressed and efficient parity codes are proposed. A controller as disclosed is configured for receiving configuration data at the controller that indicates operating features of the array and determining a parity code for operation of the array according to a permutation, wherein the configuration data specifies the array as comprising nodes defined by A=(ai,j) with size rm×k for some integers k,m, and wherein for T={v0 , . . . , Vk-1} ?Zrm a subset of vectors of size k, where for each v=(v1, . . . , vm)?T, gcd (v1, . . . , vm, r), where gcd is the greatest common divisor, such that for any l, 0?l?r?1, and v ?T, the code values are determined by the permutation fvl:[0,rm?1]?[0,rm?1]by fvl(x)=x+lv.
    Type: Grant
    Filed: March 15, 2012
    Date of Patent: April 8, 2014
    Assignee: California Institute of Technology
    Inventors: Itzhak Tamo, Zhiying Wang, Jehoshua Bruck
  • Publication number: 20120278689
    Abstract: MDS array codes are widely used in storage systems to protect data against erasures. The rebuilding ratio problem is addressed and efficient parity codes are proposed. A controller as disclosed is configured for receiving configuration data at the controller that indicates operating features of the array and determining a parity code for operation of the array according to a permutation, wherein the configuration data specifies the array as comprising nodes defined by A=(ai,j) with size rm×k for some integers k, m, and wherein for T={v0, . . . , vk?1}Zrm a subset of vectors of size k, where for each v=(v1, . . . , vm)?T, gcd(v1, . . . , vm, r), where gcd is the greatest common divisor, such that for any l, 0?l?r?1, and v?T, the code values are determined by the permutation fvl:[0,rm?1]?[0,rm?1] by fvl(x)=x+lv.
    Type: Application
    Filed: March 15, 2012
    Publication date: November 1, 2012
    Applicant: CALIFORNIA INSTITUTE OF TECHNOLOGY
    Inventors: Itzhak Tamo, Zhiying Wang, Jehoshua Bruck