Patent application number | Description | Published |
20130080861 | ERASURE CODING SCHEME FOR DEADLINES - Error correction coding for streaming communication is provided. A streaming problem is modeled as a non-multicast network problem with a nested receiver structure. Each packet in the streaming problem corresponds to a link, and each deadline in the streaming problem corresponds to a receiver in the non-multicast network problem. For the non-multicast network problem, content to be transmitted in multiple packets to multiple receivers is obtained. Each of the receivers is required to decode specific independent messages from the content, at given time steps, and has access to a subset of the content received by another receiver. The content is allocated into multiple packets to be transmitted on multiple links. No coding occurs across information demanded by different receivers. A capacity region defines a set of information rate vectors that can be communicated to the receivers successfully. A rate vector is successfully communicated if it complies with various inequalities. | 03-28-2013 |
20130259235 | KEY AGREEMENT IN WIRELESS NETWORKS WITH ACTIVE ADVERSARIES - A network and related methods for transmitting processes in a network secretly and securely is described. The network use keys, through path-key establishment and a key pool bootstrapping, to ensure that packets are transmitted and received properly and secretly in the presence of one or more adversarial nodes. | 10-03-2013 |
20130297990 | DISTRIBUTED REED-SOLOMON CODES FOR SIMPLE MULTIPLE ACCESS NETWORKS - A computer-based distributed error correction scheme with an efficient decoding algorithm is disclosed. The efficiency of the corresponding decoding algorithm, based on standard single source Reed-Solomon error correcting codes, makes the practical employment of the DECC feasible. Various implementation examples are also provided. | 11-07-2013 |
20140016469 | DETERMINISTIC DISTRIBUTED NETWORK CODING - 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. | 01-16-2014 |
20140222964 | CODING FOR REAL-TIME STREAMING UNDER PACKET ERASURES - A computer-based real-time streaming system under packet erasures wherein created messages can be decoded within a fixed delay form their creation is presented. Various code construction methods and corresponding hardware implementation for different cases of erasure link models are also presented. | 08-07-2014 |
20140250301 | NETWORK CODING-BASED ANONYMOUS COMMUNICATION - A computer-based peer-to-peer anonymous networking using a coding scheme with a formal information theoretic security characterization to construct a corresponding overlay subgraph is presented. A code construction based on linear coding which can be used for data transfer in an anonymous network is also presented. Various performance and simulation of the presented codes are provided in the Annex A1 which makes part of the present disclosure. | 09-04-2014 |
20140281345 | Distributed Storage Allocation for Heterogeneous Systems - Allocation of storage budget in a computer-based distributed storage system is described, where associated computer-based storage nodes have heterogeneous access probabilities. The problem is to allocate a given storage budget across the available computer-based nodes so as to store a unit-size data object (e.g. file) with a higher reliability (e.g. increased probability for the storage budget to be recovered). Efficient algorithms for optimizing over one or more classes of allocations are presented. A basic one-level symmetric allocation is presented, where the storage budget is spread evenly over an appropriately chosen subset of nodes. Furthermore, a two-level symmetric allocation is presented, where the budget is divided into two parts, each spread evenly over a different subset of computer-based storage nodes, such that the amount allocated to each node in the first subset is twice that of the second subset. Further expansion of the two-level symmetric allocation is provided with a three-level and a generic k-level symmetric allocation. | 09-18-2014 |
20150288516 | KEY AGREEMENT IN WIRELESS NETWORKS WITH ACTIVE ADVERSARIES - A network and related methods for transmitting processes in a network secretly and securely is described. The network use keys, through path-key establishment and a key pool bootstrapping, to ensure that packets are transmitted and received properly and secretly in the presence of one or more adversarial nodes. | 10-08-2015 |