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.

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.

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.

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.

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.

Abstract: A network node having a receiver for receiving input packets, a local node memory where one or more parameters for coding are stored, an encoder for creating coded packets from the input packets using linear network coding, and a transmitter to transmit the coded packets. Each coefficient of the linear network coding is a parameter of the one or more parameters or a pre-determined function of the one or more parameters. A related method and a network are also presented.

Abstract: A method, apparatus and computer program product providing improved communication performance through network coding is presented. Coded packets are formed at a source node, the coded packets comprising a combination of original packets at the source node. The coded packets are transmitted to at least one destination node using an unreliable protocol. A reconstruction is formed based on received coded packets at the destination node, wherein when a number of received coded packets are equal to the number of transmitted coded packets the forming a reconstruction comprises forming a complete reconstruction and wherein when the number of received coded packets is less than the number of transmitted coded packets the reconstruction comprises forming a best attempt at reconstruction.

Abstract: A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.

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.

Abstract: A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.

Abstract: A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.

Abstract: A network and a communication method are described. The network comprises: source nodes, receiver nodes, and coding nodes. The coding nodes are connected with input links for communication of input signals to the coding nodes and output links for communication of output signals from the coding nodes. The output signals are a linear combination of the input signals. The coefficients of the linear combination are deterministically chosen based on local information available locally at the coding node.