Patent ID: 8914713

Claim:
A computer-implemented method for error correction coding for streaming communication, comprising: (a) utilizing, in a computer, a coding scheme defined below in terms of a non-multicast network problem with a nested receiver structure, wherein each packet of multiple packets in a streaming problem corresponds to a link in the non-multicast network problem and each deadline of multiple deadlines in the streaming problem corresponds to a receiver in the nested receiver structure in the non-multicast network problem, wherein: (i) each receiver of multiple receivers in the nested receiver structure is required to decode specific messages {M 1 ,M 2 , . . . M n ), from content of received packets, at given time steps {m 1 , m 2 , . . . m n } respectively; and (ii) each of the multiple receivers in the nested receiver structure has access to a subset of the content received by another receiver in the nested receiver structure; and (b) allocating, in the computer, the content into the multiple packets, wherein: no coding occurs across information demanded by different receivers in the nested receiver structure; (ii) a capacity region defines a set of information rate vectors {u 1 , u 2 , . . . u n , }, that can be communicated to the multiple receivers in the nested receiver structure successfully; (iii) an information rate vector (u 1 , u 2 , . . ., u n ) from the set of information rate vectors is successfully communicated if: (1) a sum of amounts (y i j ) of the information corresponding to a message M j transmitted on unerased links l i , is greater than or equal to u j for each of one or more erasure patterns per: ∀ j : 1 ≤ j ≤ n ⁢ ⁢ u j ≤ ∑ i ∈ P ⋂ { 1 , … ⁢ , m i } ⁢ y i j ❘ where P denotes a set of unerased links for each erasure pattern; and (2) the sum of y i j for 1≦j≦n is less than or equal to 1 per: ∀ i : 1 ≤ i ≤ m n ⁢ ⁢ ∑ j = 1 n ⁢ y i j ≤ 1.