Repairable Fountain Codes
This paper is eligible for the student paper award. The authors introduce a new family of fountain codes that are systematic and also have sparse parities. Although this is impossible if they require the code to be MDS, they show it can be achieved if they relax their requirement into a near-MDS property. Their codes produce an unbounded number of output symbols, creating each parity independently by linearly combining a logarithmic number of input symbols.