Corpus ID: 23506719

# Coding with asymmetric prior knowledge

@article{Andoni2017CodingWA,
title={Coding with asymmetric prior knowledge},
author={A. Andoni and J. Ghaderi and Daniel J. Hsu and D. Rubenstein and O. Weinstein},
journal={ArXiv},
year={2017},
volume={abs/1707.04875}
}
• A. Andoni, +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

#### References

SHOWING 1-10 OF 30 REFERENCES
Distributed source coding for sensor networks
• Computer Science
• IEEE Signal Processing Magazine
• 2004
• 790
• PDF
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2006
• 6,141
• PDF
Universal polar codes
• Mathematics, Computer Science
• 2014 IEEE International Symposium on Information Theory
• 2014
• 86
• PDF
Protocols for Asymmetric Communication Channels
• Computer Science
• J. Comput. Syst. Sci.
• 2001
• 33
• PDF
Improved bounds for asymmetric communication protocols
• Computer Science
• Inf. Process. Lett.
• 2002
• 16
Approximate sparse recovery: optimizing time and measurements
• Mathematics, Computer Science
• STOC '10
• 2010
• 66
• PDF
On finite alphabet compressive sensing
• Computer Science, Mathematics
• 2013 IEEE International Conference on Acoustics, Speech and Signal Processing
• 2013
• 23
• PDF