{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:39:54Z","timestamp":1648971594664},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> Compressed sensing (CS) is a new data acquisition theory taking full use of the sparsity of signals. It reveals that higher-dimensional sparse signals can be reconstructed from fewer nonadaptive linear measurements. The construction of CS matrices in CS is the key problem. In this paper, the deterministic CS matrices from optimal codebooks are constructed. Furthermore, the maximum sparsity of recovering the sparse signals by using our CS matrices are obtained. Meanwhile, a comparison is made with the CS matrices constructed by DeVore based on polynomials over finite fields. In the numerical simulations, our CS matrix outperforms DeVore[Formula: see text]s matrix in the process of recovering sparse signals. <\/jats:p>","DOI":"10.1142\/s1793830920500421","type":"journal-article","created":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T16:07:12Z","timestamp":1584374832000},"page":"2050042","source":"Crossref","is-referenced-by-count":0,"title":["Welch bound-achieving compressed sensing matrices from optimal codebooks"],"prefix":"10.1142","volume":"12","author":[{"given":"Gang","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Tianjin Normal University, Tianjin 300387, P. R. China"}]},{"given":"Min-Yao","family":"Niu","sequence":"additional","affiliation":[{"name":"School of Sciences, Beijing University of Posts and Telecommunications, Beijing 100876, P. R. China"}]},{"given":"You","family":"Gao","sequence":"additional","affiliation":[{"name":"College of Science, Civil Aviation University of China, Tianjin 300300, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"S1793830920500421BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2169249"},{"key":"S1793830920500421BIB002","doi-asserted-by":"publisher","DOI":"10.1215\/00127094-1384809"},{"key":"S1793830920500421BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"S1793830920500421BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"S1793830920500421BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.04.002"},{"key":"S1793830920500421BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907343"},{"key":"S1793830920500421BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"S1793830920500421BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173241"},{"key":"S1793830920500421BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196256"},{"key":"S1793830920500421BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0551-0_6"},{"key":"S1793830920500421BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2018.09.042"},{"key":"S1793830920500421BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055219"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T10:50:05Z","timestamp":1594205405000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,26]]},"references-count":12,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S1793830920500421"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500421","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,26]]}}}