Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Intermediate Performance of Rateless Codes   Rateless/fountain codes are designed so that all input symbols can be
recovered from a slightly larger number of coded symbols, with high probability
using an iterative decoder. In this paper we investigate the number of input
symbols that can be recovered by the same decoder, but when the number of coded
symbols available is less than the total number of input symbols. Of course
recovery of all inputs is not possible, and the fraction that can be recovered
will depend on the output degree distribution of the code.
  In this paper we (a) outer bound the fraction of inputs that can be recovered
for any output degree distribution of the code, and (b) design degree
distributions which meet/perform close to this bound. Our results are of
interest for real-time systems using rateless codes, and for Raptor-type
two-stage designs.

27
The categories of this paper are: comp-gas
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
3
The categories of this paper are: physics
6
The categories of this paper are: astro-ph
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg