Adaptive rateless coding under partial information

We present novel rateless codes that generalize and outperform LT codes (with respect to overall communication and computation complexity) when some input symbols are already available at the decoding host. This case can occur in data synchronization scenarios, or where feedback is provided or can be inferred from transmission channel models. We provide analysis and experimental evidence of this improvement, and demonstrate the efficiency of the new code through implementation on highly constrained sensor devices.