Fundamental Limits on Data Acquisition: Trade-offs Between Sample Complexity and Query Difficulty

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 126
  • Download : 0
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 be recovered with high probability from any sufficiently large set of measurements of size n. In the query design, the average number of information bits that is associated with one parity measurement is called query difficulty (d̅) and the minimum number of measurements required to recover the k information bits for a fixed d̅ is called sample complexity (n). We analyze the fundamental trade-offs between the query difficulty and the sample complexity, and show that the sample complexity of n = c max{k,(k log k)/d̅} for some constant c > 0 is necessary and sufficient to recover k information bits with high probability as k→∞.
Publisher
IEEE
Issue Date
2018-06-19
Language
English
Citation

2018 IEEE International Symposium on Information Theory (ISIT), pp.681 - 685

ISSN
2157-8117
DOI
10.1109/ISIT.2018.8437703
URI
http://hdl.handle.net/10203/247464
Appears in Collection
EE-Conference Papers(학술회의논문)MA-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0