Patents by Inventor Sivakanth Gopi

Sivakanth Gopi 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).

  • Patent number: 12260937
    Abstract: Redundancy information can be included in nucleotide symbol strings encoding underlying data. To avoid propagation of errors during the decoding process, during encoding, a constrained encoding can be performed before the redundancy information is computed. The redundancy information can be an outer encoding across multiple nucleotide symbol strings. An inner coding within nucleotide symbol strings can also be supported. Such redundancy information can be interleaved into the underlying nucleotide symbol strings to which the constrained encoding has been applied, resulting in a relaxed constraint. Insertion/deletion redundancy information can also be included in the resulting strings, and an insertion/deletion-sensitive sequence can be included to assist in recovering accurate sequences during decoding operations.
    Type: Grant
    Filed: September 5, 2019
    Date of Patent: March 25, 2025
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sergey Yekhanin, Sivakanth Gopi, Henry Pfister, Karin Strauss
  • Publication number: 20240346178
    Abstract: Disclosed is a system that tracks website usage without compromising user privacy. The system aggregates website usage data of multiple users across multiple websites. Website usage data is aggregated in a way that preserves each individual user's privacy. Specifically, information relevant to a particular user may be obtained from the aggregated information without exposing what was actually collected from that user. In some configurations, user-specific website usage data is aggregated using trusted execution environment computing hardware. This ensures that privacy is preserved while user-specific data is transferred to and processed by the system. The trusted execution environment applies differential privacy techniques to ensure that use of the aggregated information does not reveal actual information about a user's website usage history. In this way, privacy is maintained while still enabling many of the scenarios that would otherwise rely on third-party cookies.
    Type: Application
    Filed: April 17, 2023
    Publication date: October 17, 2024
    Inventors: Erik Daniel ANDERSON, Joseph J. PFEIFFER, III, Denis Xavier CHARLES, Aleksandr REBRIKOV, John Robert MOORING, Brandon J. MASLEN, Davis Leland GILTON, Sergey YEKHANIN, Sivakanth GOPI
  • Patent number: 11495324
    Abstract: Data that has been stored according to a DNA data storage method can be decoded using a flexible approach that supports both solitary strand mapping and cluster-based trace reconstruction. Solitary strand mapping can place strings based on integrity verification. Redundancy information can be partitioned to support error correction during the solitary strand mapping while still achieving integrity verification. Clusters with verified strands can be skipped during cluster-based trace reconstruction. Useful for increasing the accuracy of the trace reconstruction procedure.
    Type: Grant
    Filed: October 1, 2019
    Date of Patent: November 8, 2022
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sergey Yekhanin, Sivakanth Gopi
  • Publication number: 20220166446
    Abstract: Techniques for achieving reductions in cost of encoding and decoding operations used in DNA data storage systems to facilitate reducing errors in those encoding and decoding operations while accounting for a code structure used during the encoding and decoding by constructing and using insertion-deletion-substitution (IDS) trellises for multiple traces are disclosed. A DNA sequencing channel is used to randomly sample and sequence DNA strands to generate noisy traces. Multiple trellises are independently constructed for each respective noisy trace. A forward-backward algorithm is run on each trellis to compute posterior marginal probabilities for vertices included in each trellises. An estimate of the data message sequence is then computed.
    Type: Application
    Filed: November 24, 2020
    Publication date: May 26, 2022
    Inventors: Sergey Mikhailovich YEKHANIN, Sivakanth GOPI, Henry David PFISTER, Sundara Rajan SRINIVASAVARADHAN
  • Patent number: 11343012
    Abstract: A system and method for applying noise to data is described. The system accesses a metric value of a metric of each user from a group of users of an application. The metric indicates a measure of an operation of the application by a corresponding user. The system generates noise values and defines a distribution of the noise values to the group of users. The system modifies the metric value of the metric of each user with a corresponding noise value from the noise values based on the distribution.
    Type: Grant
    Filed: March 5, 2020
    Date of Patent: May 24, 2022
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Anjaneya Malpani, Jagadeesh Virupaksha Huliyar, Xinyun Sun, Sreeram Nivarthi, Muthukrishnan Paramasivam, Dheepak Ramaswamy, Sriradha Selvaraj, Ananthatejas Raghavan, Sergey Yekhanin, Janardhan Kulkarni, Aleksey Ashikhmin, Sivakanth Gopi, Bingran Luo
  • Publication number: 20210281483
    Abstract: A system and method for applying noise to data is described. The system accesses a metric value of a metric of each user from a group of users of an application. The metric indicates a measure of an operation of the application by a corresponding user. The system generates noise values and defines a distribution of the noise values to the group of users. The system modifies the metric value of the metric of each user with a corresponding noise value from the noise values based on the distribution.
    Type: Application
    Filed: March 5, 2020
    Publication date: September 9, 2021
    Inventors: Anjaneya Malpani, Jagadeesh Virupaksha Huliyar, Xinyun Sun, Sreeram Nivarthi, Muthukrishnan Paramasivam, Dheepak Ramaswamy, Sriradha Selvaraj, Ananthatejas Raghavan, Sergey Yekhanin, Janardhan Kulkarni, Aleksey Ashikhmin, Sivakanth Gopi, Bingran Luo
  • Publication number: 20210098081
    Abstract: Data that has been stored according to a DNA data storage method can be decoded using a flexible approach that supports both solitary strand mapping and cluster-based trace reconstruction. Solitary strand mapping can place strings based on integrity verification. Redundancy information can be partitioned to support error correction during the solitary strand mapping while still achieving integrity verification. Clusters with verified strands can be skipped during cluster-based trace reconstruction. Useful for increasing the accuracy of the trace reconstruction procedure.
    Type: Application
    Filed: October 1, 2019
    Publication date: April 1, 2021
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Sergey Yekhanin, Sivakanth Gopi
  • Publication number: 20210074380
    Abstract: Redundancy information can be included in nucleotide symbol strings encoding underlying data. To avoid propagation of errors during the decoding process, during encoding, a constrained encoding can be performed before the redundancy information is computed. The redundancy information can be an outer encoding across multiple nucleotide symbol strings. An inner coding within nucleotide symbol strings can also be supported. Such redundancy information can be interleaved into the underlying nucleotide symbol strings to which the constrained encoding has been applied, resulting in a relaxed constraint. Insertion/deletion redundancy information can also be included in the resulting strings, and an insertion/deletion-sensitive sequence can be included to assist in recovering accurate sequences during decoding operations.
    Type: Application
    Filed: September 5, 2019
    Publication date: March 11, 2021
    Applicant: Microsoft Technology Licensing, LLC
    Inventors: Sergey Yekhanin, Sivakanth Gopi, Henry Pfister, Karin Strauss