A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider query-based data acquisition and the corresponding information recovery problem, where the goal is to recover k binary variables (information bits) from parity measurements of those variables. The queries and the corresponding parity measurements are designed using the encoding rule of Fountain codes. By using Fountain codes, we can design potentially limitless number of queries, and corresponding parity measurements, and guarantee that the original k information bits can bearXiv:1712.00157v2 fatcat:tx7vmhzimzdntb6rmwd2fqiwia