Aalborg Universitet

Nokia Technologies Oy

Steinwurf Aps

Morten V Pedersen

Janus Heide

Daniel E Lucani

Frank H P Fitzek

Frank Fitzek

Márton A Sipos

Pihl Jeppe

Frank HP Fitzek

A method for encoding data comprises choosing a sequence of pivot candidate positions for a sequence of g encoding vectors to encode a block of g data symbols in a round of coded packets by: providing a set of g pivot candidate positions; choosing a pivot candidate position for the sequence from the set of pivot candidate positions; removing the chosen pivot candidate position from the set of pivot candidate positions; and repeating until the set of pivot candidate positions is empty and the sequence of chosen pivot candidate positions for the round is non-linear. A set of encoding vectors is generated based on the chosen sequence of pivot candidate positions, each encoding vector comprising zero valued coefficients for positions within the encoding vector before the pivot candidate position for the encoding vector and a non-zero valued coefficient for at least the pivot candidate position.

Selection of pivot positions for linear network codes

A method for use in a distributed storage system having a plurality of nodes, the method including receiving, at a source node, original data, encoding the original data into plurality of coded fragments using a linear code, transmitting at least a first one of the coded fragments from the source node to a first sink node. The method further includes receiving, at the source node, modified data, calculating, at the source node, a coded difference between the original data and the modified data, transmitting the coded difference from the source node to the first sink node; and recovering, at the first sink node, at least a first portion of the modified data using the coded difference and the at least a first one of the coded fragments.

Method for file updating and version control for linear erasure coded and network coded storage

Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof.

Fulcrum network codes

Network coding by beam forming in networks, for example, in single frequency networks, can provide aid in increasing spectral efficiency. When network coding by beam forming and user cooperation are combined, spectral efficiency gains may be achieved. According to certain embodiments, a method includes operating a user equipment of a plurality of user equipment in a network comprising a plurality of access points. The method also includes the user equipment forming a beam. The method further receives processing received signals from at least one of the plurality of access points at the user equipment. The forming the beam is configured to let different user equipment of the plurality of user equipment to receive different signals from the plurality of access points to achieve diversity by using different beams amongst the plurality of user equipment. The method additionally includes cooperating with the plurality of user equipment to decode the received data.

Growing community of inventors

Aalborg, Denmark

Morten V Pedersen