Patents by Inventor Muriel Medard

Muriel Medard 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: 11902407
    Abstract: Techniques are disclosed for an adaptive and causal random linear network coding (AC-RLNC) with forward error correction (FEC) for a communication channel with delayed feedback. An example methodology implementing the techniques includes transmitting one or more coded packets in a communication channel, determining a channel behavior of the channel, and adaptively adjusting a transmission of a subsequent coded packet in the first channel based on the determined channel behavior. The communication channel may be a point-to-point communication channel between a sender and a receiver. The channel behavior may be determined based on feedback acknowledgements provided by the receiver. The subsequent coded packet may be a random linear combination of one or more information packets.
    Type: Grant
    Filed: December 12, 2022
    Date of Patent: February 13, 2024
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel Medard, Derya Malak, Alejandro Cohen
  • Patent number: 11870459
    Abstract: Described is a decoder suitable for use with any communication or storage system. The described decoder has a modular decoder hardware architecture capable of implementing a noise guessing process and due to its dependency only on noise, the decoder design is independent of any encoder, thus making it a universal decoder. Hence, the decoder architecture described herein is agnostic to any coding scheme.
    Type: Grant
    Filed: April 8, 2021
    Date of Patent: January 9, 2024
    Assignees: Massachusetts Institute of Technology, National University of Ireland Maynooth, Trustees of Boston University
    Inventors: Amit Solomon, Muriel Medard, Kenneth R. Duffy, Rabia Tugce Yazicigil Kirby, Vaibhav Bansal, Wei An
  • Patent number: 11838040
    Abstract: Described are concepts, systems, devices and methods that enhance decoding performance of channels subject to correlated noise. The concepts, systems, devices and methods can be used with any combination of codes, code-rates and decoding techniques. In embodiments, a continuous realization of effective noise is estimated from a lead channel by subtracting its decoded output from its received signal. This estimate is then used to improve the accuracy of decoding of an otherwise orthogonal channel that is experiencing correlated effective noise. In this approach, channels aid each other through the post-decoding provision of estimates of effective noise. In some embodiments, the lead channel is not pre-determined, but is chosen dynamically based on which of a plurality of decoders completes first, or using soft information including an estimate of effective noise that is least energetic or most likely to have occurred.
    Type: Grant
    Filed: July 22, 2022
    Date of Patent: December 5, 2023
    Assignees: Massachusetts Institute of Technology, National University of Ireland, Maynooth
    Inventors: Muriel Medard, Kenneth R. Duffy, Amit Solomon, Alejandro Cohen
  • Patent number: 11784666
    Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.
    Type: Grant
    Filed: August 15, 2022
    Date of Patent: October 10, 2023
    Assignees: Massachusetts Institute of Technology, National University of Ireland, Maynooth
    Inventors: Muriel Medard, Kenneth R. Duffy
  • Publication number: 20230123204
    Abstract: Techniques are disclosed for an adaptive and causal random linear network coding (AC-RLNC) with forward error correction (FEC) for a communication channel with delayed feedback. An example methodology implementing the techniques includes transmitting one or more coded packets in a communication channel, determining a channel behavior of the channel, and adaptively adjusting a transmission of a subsequent coded packet in the first channel based on the determined channel behavior. The communication channel may be a point-to-point communication channel between a sender and a receiver. The channel behavior may be determined based on feedback acknowledgements provided by the receiver. The subsequent coded packet may be a random linear combination of one or more information packets.
    Type: Application
    Filed: December 12, 2022
    Publication date: April 20, 2023
    Applicant: Massachusetts Institute of Technology
    Inventors: Muriel Medard, Derya Malak, Alejandro Cohen
  • Patent number: 11575777
    Abstract: Techniques are disclosed for an adaptive and causal random linear network coding (AC-RLNC) with forward error correction (FEC) for a communication channel with delayed feedback. An example methodology implementing the techniques includes transmitting one or more coded packets in a communication channel, determining a channel behavior of the channel, and adaptively adjusting a transmission of a subsequent coded packet in the first channel based on the determined channel behavior. The communication channel may be a point-to-point communication channel between a sender and a receiver. The channel behavior may be determined based on feedback acknowledgements provided by the receiver. The subsequent coded packet may be a random linear combination of one or more information packets.
    Type: Grant
    Filed: May 27, 2020
    Date of Patent: February 7, 2023
    Assignee: Massachusetts Institute of Technology
    Inventors: Muriel Medard, Derya Malak, Alejandro Cohen
  • Publication number: 20220393702
    Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.
    Type: Application
    Filed: August 15, 2022
    Publication date: December 8, 2022
    Applicants: Massachusetts Institute of Technology, National University of Ireland, Maynooth
    Inventors: Muriel MEDARD, Kenneth R. DUFFY
  • Publication number: 20220376725
    Abstract: Described are concepts, systems, devices and methods that enhance decoding performance of channels subject to correlated noise. The concepts, systems, devices and methods can be used with any combination of codes, code-rates and decoding techniques. In embodiments, a continuous realization of effective noise is estimated from a lead channel by subtracting its decoded output from its received signal. This estimate is then used to improve the accuracy of decoding of an otherwise orthogonal channel that is experiencing correlated effective noise. In this approach, channels aid each other through the post-decoding provision of estimates of effective noise. In some embodiments, the lead channel is not pre-determined, but is chosen dynamically based on which of a plurality of decoders completes first, or using soft information including an estimate of effective noise that is least energetic or most likely to have occurred.
    Type: Application
    Filed: July 22, 2022
    Publication date: November 24, 2022
    Applicants: Massachusetts Institute of Technology, National University of Ireland, Maynooth
    Inventors: Muriel MEDARD, Kenneth R. DUFFY, Amit SOLOMON, Alejandro COHEN
  • Publication number: 20220358672
    Abstract: A way to design a codebook for estimating the type of a molecule at a particular location in a fluorescence microscopy image makes use of one or both of (1) knowledge of the non-uniform prior distribution of molecule types (i.e., some types are known a priori to occur more frequently than others) and/or knowledge of co-occurrence of molecule types at close locations (e.g., in a same cell); and (2) knowledge of a model of the (e.g., random) process that yields the intensities that are expected at a location when a molecule with a particular subset of markers (i.e., a molecule of a type that has been assigned a codeword that defines that subset) is present at that location. The codebook design may provide experimental efficiency by reducing the number of images that need to be acquired and/or improve classification or detection accuracy by making the codewords for different molecule types more distinctive.
    Type: Application
    Filed: April 27, 2022
    Publication date: November 10, 2022
    Inventors: Mehrtash Babadi, Luca D'Alessio, Muriel Medard, Ken Duffy, Yonina Eldar
  • Patent number: 11489761
    Abstract: A machine-implemented method for use at a destination node for transferring data from a source node, the method comprising: establishing one or more connections with the source node; sending to the source node a request for a data stream, the request including control information to be applied at the source node, the control information including a number of degrees of freedom (DoFs) or frames to be transmitted across each of the one or more connections; and receiving one or more coded frames through the data stream over the one or more connections.
    Type: Grant
    Filed: April 23, 2020
    Date of Patent: November 1, 2022
    Assignee: Code On Network Coding, LLC
    Inventors: Flavio du Pin Calmon, Muriel Medard, Kerim Fouli
  • Patent number: 11463372
    Abstract: In some embodiments, a method comprises: transmitting first data units from a source node to a destination node over a first path; receiving information about the availability of one or more second paths between the source and destination nodes; determining a cost associated with each of the one or more second paths; allocating a first number of second data units to the first path and a second number of second data units to the one or more second paths based on the determined costs; and transmitting the second data units from the source node to the destination node over the first path and/or the one or more second paths according to the allocation, wherein the first data units, the second data units, or both the first and second data units comprise network coded data.
    Type: Grant
    Filed: April 23, 2020
    Date of Patent: October 4, 2022
    Assignee: Code On Network Coding, LLC
    Inventors: Flavio du Pin Calmon, Muriel Medard, Kerim Fouli
  • Patent number: 11463113
    Abstract: Systems and techniques described herein include jointly decoding coded data of different codes, including different coding algorithms, finite fields, and/or source blocks sizes. The techniques described herein can be used to improve existing distributed storage systems by allowing gradual data migration. The techniques can further be used within existing storage clients to allow application data to be stored within diverse different distributed storage systems.
    Type: Grant
    Filed: January 27, 2017
    Date of Patent: October 4, 2022
    Assignees: Massachusetts Institute of Technology, Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.
    Inventors: Muriel Medard, Cornelius Hans Ulrich Hellge
  • Patent number: 11451247
    Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.
    Type: Grant
    Filed: July 9, 2021
    Date of Patent: September 20, 2022
    Assignees: Massachusetts Institute of Technology, National University of Ireland, Maynooth
    Inventors: Muriel Medard, Kenneth R. Duffy
  • Patent number: 11431368
    Abstract: Described are concepts, systems, devices and methods that enhance decoding performance of channels subject to correlated noise. The concepts, systems, devices and methods can be used with any combination of codes, code-rates and decoding techniques. In embodiments, a continuous realization of effective noise is estimated from a lead channel by subtracting its decoded output from its received signal. This estimate is then used to improve the accuracy of decoding of an otherwise orthogonal channel that is experiencing correlated effective noise. In this approach, channels aid each other through the post-decoding provision of estimates of effective noise. In some embodiments, the lead channel is not pre-determined, but is chosen dynamically based on which of a plurality of decoders completes first, or using soft information including an estimate of effective noise that is least energetic or most likely to have occurred.
    Type: Grant
    Filed: March 16, 2021
    Date of Patent: August 30, 2022
    Assignees: Massachusetts Institute of Technology, National University of Ireland, Maynooth
    Inventors: Muriel Medard, Kenneth R. Duffy, Amit Solomon, Alejandro Cohen
  • Patent number: 11424861
    Abstract: A method and apparatus decode packetized data in the presence of packet erasures using a finite sliding window technique. A decoder receives packets containing uncoded and coded symbols. When a packet with a coded symbol is received, the decoder determines whether a packet sequence number is within a sliding window of w consecutive sequence numbers that are no greater than a decoder sequence number, where the number w is fixed prior to encoding. When this is the case, the decoder decodes the coded symbol into one or more of the w input symbols using the coefficient vector. Decoding may use a forward error correcting (FEC) window within the finite sliding window. Decoding also may use a technique of Gaussian elimination to produce a “shifted” row echelon coefficient matrix.
    Type: Grant
    Filed: March 29, 2018
    Date of Patent: August 23, 2022
    Assignees: Massachusetts Institute of Technology, Code On Network Coding, LLC, Technische Universität Dresden
    Inventors: Kerim Fouli, Frank Gabriel, Muriel Medard, Sreekrishna Pandi, Simon Wunderlich
  • Patent number: 11418449
    Abstract: Multipath coding systems, devices and methods are disclosed. In a multipath network, devices and methods generate at least one of a plurality of uncoded packets for transmission on a first path from a source node to a destination node as well as at least one coded packet based upon a set of uncoded packets for transmission on a second path from the source node to the destination node. The set of uncoded packets are formed, generated or otherwise provided from a next uncoded packet to be transmitted, a number (?) of previously transmitted uncoded packets, and a number (?) of uncoded packets that are to be transmitted after the next uncoded packet and ?+? is greater than zero. The destination node operates to receive, and decode as needed, the uncoded and coded packets.
    Type: Grant
    Filed: May 16, 2019
    Date of Patent: August 16, 2022
    Assignee: Code On Network Coding, LLC
    Inventors: Kerim Fouli, Muriel Medard
  • Patent number: 11381339
    Abstract: A method comprising reframing one or more QUIC frames into a packed frame; and applying network coding to the packed frame to generate a coded frame.
    Type: Grant
    Filed: November 6, 2018
    Date of Patent: July 5, 2022
    Assignee: Code On Network Coding, LLC
    Inventors: Muriel Medard, László Viktor Jánoky, Patrik János Braun
  • Publication number: 20220069987
    Abstract: A system and method provide a hybrid communication scheme that achieves high communication rates with post-quantum computational security guarantees. Messages to be securely communicated are first mixed using an individually secure encoding, such as a linear network code, and some of the encoded messages are further encrypted. The encrypted and unencrypted messages are sent via different communications channels. Each unencrypted message becomes almost as secure as the encrypted messages because of the pre-mixing, since decoding any one of the messages requires all of the messages, including the encrypted messages. Thus, a very few encrypted messages may be used, allowing the rate of communication to approach one as the number of channels increases. This is particularly beneficial when a classical public-key cryptosystem can only be used in part of the data transmitted or stored, in the presence of noisy channels, in distributed data storage, and other applications.
    Type: Application
    Filed: August 30, 2021
    Publication date: March 3, 2022
    Inventors: Muriel MEDARD, Alejandro COHEN, Rafael Gregorio Lucas D'OLIVEIRA, Salman SALAMATIAN
  • Patent number: 11226951
    Abstract: Described are devices, systems and techniques for implementing atomic memory objects in a multi-writer, multi-reader setting. In an embodiment, the devices, systems and techniques use maximum distance separable (MDS) codes, and may be specifically designed to optimize a total storage cost for a given fault-tolerance requirement. Also described is an embodiment to handle the case where some of the servers can return erroneous coded elements during a read operation.
    Type: Grant
    Filed: November 23, 2020
    Date of Patent: January 18, 2022
    Assignees: Massachusetts Institute of Technology, Northeastern University, University of Connecticut
    Inventors: Muriel Medard, Kishori Mohan Konwar, Prakash Narayana Moorthy, Nancy Ann Lynch, Erez Kantor, Alexander Allister Schwarzmann
  • Publication number: 20220014214
    Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.
    Type: Application
    Filed: July 9, 2021
    Publication date: January 13, 2022
    Inventors: Muriel Medard, Kenneth R. Duffy