pith. sign in

arxiv: 0910.1121 · v1 · submitted 2009-10-06 · 💻 cs.IT · math.IT

LP Decoding meets LP Decoding: A Connection between Channel Coding and Compressed Sensing

classification 💻 cs.IT math.IT
keywords decodinglinearconnectionmatrixprogrammingbinarycc-lpdchannel
0
0 comments X
read the original abstract

This is a tale of two linear programming decoders, namely channel coding linear programming decoding (CC-LPD) and compressed sensing linear programming decoding (CS-LPD). So far, they have evolved quite independently. The aim of the present paper is to show that there is a tight connection between, on the one hand, CS-LPD based on a zero-one measurement matrix over the reals and, on the other hand, CC-LPD of the binary linear code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows one to translate performance guarantees from one setup to the other.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.