Massachusetts Institute of Technology

Juniper Networks, Inc.

Netapp, Inc.

Boston University

University of Connecticut

Northeastern University

Network Appliance, Inc.

Other

Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V.

California Institute of Technology

Harvard College

University of Illinois

Rutgers, the State University of New Jersey

The Broad Institute, Inc.

Telefonica, S.a.

Muriel Medard

Kenneth R Duffy

Xiaomeng Shi

Kerim Fouli

Ralf Koetter

Linda M Zeger

Minji Kim

Flavio Du Pin Calmon

Alejandro Cohen

Supratim Deb

Joao Barros

Marie-Jose Montpetit

Ulric J Ferner

Stephen R Chinn

John D Moores

Gene M Ciancaglini

Salil A Parikh

Prakash Narayana Moorthy

Steven Lumetta

Daniel Lucani

Jay Kumar Sundararajan

Devavrat D Shah

Tong Wang

Alberto Lopez Toledo

Mark R Parquette

Michael P Warres

James A Hart

Ali ParandehGheibi

Michael M Garofalo

Nancy Ann Lynch

Arman Rezaee

Fang Zhao

Louis M Colon, Jr

Steluta Gheorghiu

Luisa Lima

Amit Solomon

Joao Vilela

Surat Teerapittayanon

Desmond S Lun

Kishori Mohan Konwar

Tracey Ho

Michael Kilian

Anantha P Chandrakasan

Robert W Scheifler

Richard A Barry

Milica Stojanovic

Michael James Rydeen

Michael D Mitzenmacher

Mohammad Karzand

Steven G Finn

Douglas Leith

William Proulx

Szymon Jakubczak

Jason M Cloud

Weifei Zeng

Mark Aikens

James M Hurley

Matthew McShane

Atilla Eryilmaz

Asuman Ozdaglar

Erez Kantor

Bernhard Haeupler

Andres Garcia Saavedra

Alexander Allister Schwarzmann

Derya Malak

Georgios Angelopoulos

Katherine L Hall

Amanda Peters

David R Karger

Michelle Effros

Lizhong Zheng

Wei An

Kristin A Rauschenbach

Nadia Fawaz

Guy Oliveira

Donald Proulx

Michael Lupinacci

Paul Marichal

Nuala Koetter, Legal Representative

Frank Gabriel

Simon Wunderlich

Robert G Gallager

Mark M Christiansen

Daniel E Lucani

Parastoo Sadeghi

Siddharth Ray

Vitaly Abdrashitov

Niranjan Ratnakar

László Viktor Jánoky

Sreekrishna Pandi

Cornelius Hans Ulrich Hellge

Patrik János Braun

Ruth Bergman

Agnes H Chan

Jiange Li

Catherine M Grgicak

Marie-Joseph Montpetit

Allen Hamedany

Chris Losso

Harish Swaminathan

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.

Network coding-based post-quantum cryptography

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.

Coding for multiplexed fluorescence microscopy

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.

Adaptive causal network coding with feedback

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.

Universal guessing random additive noise decoding (GRAND) decoder

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.

Noise recycling

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.

Decoding signals by guessing noise

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.

Method and apparatus for coded multipath network communication

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.

Apparatus and method for multi-code distributed storage

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.

Method and apparatus for coded multipath networking using path management and protocol translation

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.

System and technique for sliding window network coding-based packet generation

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 (&#x3b1;) of previously transmitted uncoded packets, and a number (&#x3b2;) of uncoded packets that are to be transmitted after the next uncoded packet and &#x3b1;+&#x3b2; is greater than zero. The destination node operates to receive, and decode as needed, the uncoded and coded packets.

Multipath coding apparatus and related techniques

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.

System and technique for generating, transmitting and receiving network coded (NC) quick UDP internet connections (QUIC) packets

Growing community of inventors

Belmont, MA, United States of America

Muriel Medard