Corpus ID: 23506719

Coding with asymmetric prior knowledge

  title={Coding with asymmetric prior knowledge},
  author={A. Andoni and J. Ghaderi and Daniel J. Hsu and D. Rubenstein and O. Weinstein},
  • A. Andoni, J. Ghaderi, +2 authors O. Weinstein
  • Published 2017
  • Computer Science, Mathematics
  • ArXiv
  • We study the problem of compressed sensing with asymmetric prior information, as motivated by networking applications such as identity tracking in an Internet-of-Things environment. We focus on the scenario in which a resource-limited encoder needs to report a small subset $S$ from a universe of $N$ objects to a more powerful decoder. The distinguishing feature of our model is asymmetry: the subset $S$ is an i.i.d. sample from a prior distribution $\mu$, and $\mu$ is only known to the decoder… CONTINUE READING


    Distributed source coding for sensor networks
    • 790
    • PDF
    Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
    • E. Candès, T. Tao
    • Mathematics, Computer Science
    • IEEE Transactions on Information Theory
    • 2006
    • 6,141
    • PDF
    Universal polar codes
    • 86
    • PDF
    Protocols for Asymmetric Communication Channels
    • 33
    • PDF
    Compressed Sensing
    • 5,676
    • PDF
    New Protocols for Asymmetric Communication Channels
    • 21
    • PDF
    Improved bounds for asymmetric communication protocols
    • 16
    Approximate sparse recovery: optimizing time and measurements
    • 66
    • PDF
    On finite alphabet compressive sensing
    • A. K. Das, S. Vishwanath
    • Computer Science, Mathematics
    • 2013 IEEE International Conference on Acoustics, Speech and Signal Processing
    • 2013
    • 23
    • PDF