Back to Search
Start Over
Bipartite Graph based Construction of Compressed Sensing Matrices
- Publication Year :
- 2014
-
Abstract
- This paper proposes an efficient method to construct the bipartite graph with as many edges as possible while without introducing the shortest cycles of length equal to 4. The binary matrix associated with the bipartite graph described above presents comparable and even better phase transitions than Gaussian random matrices.
- Subjects :
- Computer Science - Information Theory
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1404.4939
- Document Type :
- Working Paper