{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T04:21:08Z","timestamp":1692505268079},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T00:00:00Z","timestamp":1471910400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0068-y","type":"journal-article","created":{"date-parts":[[2016,8,23]],"date-time":"2016-08-23T10:22:13Z","timestamp":1471947733000},"page":"245-256","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields"],"prefix":"10.1007","volume":"34","author":[{"given":"Yingmo","family":"Jie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangjie","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"issue":"1","key":"68_CR1","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TSP.2011.2169249","volume":"60","author":"A Amini","year":"2012","unstructured":"Amini A, Montazerhodjat V, Marvasti F (2012) Matrices with small coherence using $$p$$ p -ary block codes. IEEE Trans Signal Process 60(1):172\u2013181","journal-title":"IEEE Trans Signal Process"},{"issue":"4","key":"68_CR2","doi-asserted-by":"crossref","first-page":"2360","DOI":"10.1109\/TIT.2011.2111670","volume":"57","author":"A Amini","year":"2011","unstructured":"Amini A, Marvasti F (2011) Deterministic construction of binary, bipolar and ternary compressed sensing matrices. IEEE Trans Inf Theory 57(4):2360\u20132370","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"68_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.acha.2008.08.002","volume":"26","author":"L Applebaum","year":"2009","unstructured":"Applebaum L, Howard S, Searle S, Calderbank R (2009) Chirp sensing codes: deterministic compressed sensing measurements for fast recovery. Appl Comput Harmon Anal 26(2):283\u2013290","journal-title":"Appl Comput Harmon Anal"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Berinde R, Gilbert A, Indyk P, Karloff H, Strauss M (2008) Combining geometry and combinatorics: a unified approach to sparse signal recovery, In Proceeding 46th Annual Allerton Conference Communication, Control, Computing, pp. 798\u2013805","DOI":"10.1109\/ALLERTON.2008.4797639"},{"issue":"1","key":"68_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1215\/00127094-1384809","volume":"159","author":"J Bourgain","year":"2011","unstructured":"Bourgain J, Dilworth S, Ford K, Konyagin S, Kutzarova D (2011) Explicit constructions of RIP matrices and related problems. Duke Math J 159(1):145\u2013185","journal-title":"Duke Math J"},{"key":"68_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-regular graphs","author":"A Brouwer","year":"1989","unstructured":"Brouwer A, Cohen A, Neumaier A (1989) Distance-regular graphs. Springer, Berlin"},{"issue":"2","key":"68_CR7","first-page":"358","volume":"4","author":"R Calderbank","year":"2010","unstructured":"Calderbank R, Howard S, Jafarpour S (2010) Construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property. IEEE Trans Inf Theory 4(2):358\u2013374","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"68_CR8","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E, Romberg J, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurement. Commun Pure Appl Math 59(8):1207\u20131223","journal-title":"Commun Pure Appl Math"},{"issue":"2","key":"68_CR9","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52(2):489\u2013509","journal-title":"IEEE Trans Inf Theory"},{"issue":"9\u201310","key":"68_CR10","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"E Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s E (2008) The restricted isometry property and its implications for compressed sensing. Comptes Rendus Math 346(9\u201310):589\u2013592","journal-title":"Comptes Rendus Math"},{"issue":"12","key":"68_CR11","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s E, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203\u20134215","journal-title":"IEEE Trans Inf Theory"},{"issue":"12","key":"68_CR12","doi-asserted-by":"crossref","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E, Tao T (2006) Near-optimal signal recovery from random projections: universal encoding strategies. IEEE Trans Inf Theory 52(12):5406\u20135425","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"68_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen A, Dahmen W, DeVore R (2009) Compressed sensing and best $$k$$ k -term approximation. J Am Math Soc 22(1):211\u2013231","journal-title":"J Am Math Soc"},{"issue":"9","key":"68_CR14","doi-asserted-by":"crossref","first-page":"4395","DOI":"10.1109\/TIT.2010.2054653","volume":"56","author":"M Davenport","year":"2009","unstructured":"Davenport M, Wakin M (2009) Analysis of orthogonal matching pursuit using the restricted isometry property. IEEE Trans Inf Theory 56(9):4395\u20134401","journal-title":"IEEE Trans Inf Theory"},{"issue":"4\u20136","key":"68_CR15","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.jco.2007.04.002","volume":"23","author":"R DeVore","year":"2007","unstructured":"DeVore R (2007) Deterministic constructions of compressed sensing matrices. J Complex 23(4\u20136):918\u2013925","journal-title":"J Complex"},{"issue":"2","key":"68_CR16","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","volume":"58","author":"D Donoho","year":"2006","unstructured":"Donoho D, Tsaig Y, Drori I, Starck J (2006) Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit. IEEE Trans Inf Theory 58(2):1094\u20131121","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"68_CR17","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho D (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289\u20131306","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"68_CR18","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1109\/JPROC.2010.2045092","volume":"98","author":"A Gilbert","year":"2010","unstructured":"Gilbert A, Indyk P (2010) Sparse recovery using sparse matrices. Proc IEEE 98(6):937\u2013947","journal-title":"Proc IEEE"},{"key":"68_CR19","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.neunet.2015.03.013","volume":"67","author":"B Gu","year":"2015","unstructured":"Gu B, Sheng S, Wang Z, Ho D, Osman S, Li S (2015) Incremental learning for v-support vector regression. Neural Netw 67:140\u2013150","journal-title":"Neural Netw"},{"key":"68_CR20","volume-title":"Balanced generalized weighing matrices and conference matrices, in the CRC handbook of combinatorial designs","author":"Y Ionin","year":"2007","unstructured":"Ionin Y, Kaharaghani H (2007) Balanced generalized weighing matrices and conference matrices, in the CRC handbook of combinatorial designs, 2nd edn. CRC Press, Boca Raton","edition":"2"},{"issue":"1","key":"68_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TCOMM.2002.807628","volume":"51","author":"G Karystinos","year":"2003","unstructured":"Karystinos G, Pados D (2003) New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets. IEEE Trans Inf Theory 51(1):48\u201351","journal-title":"IEEE Trans Inf Theory"},{"issue":"8","key":"68_CR22","doi-asserted-by":"crossref","first-page":"5035","DOI":"10.1109\/TIT.2012.2196256","volume":"58","author":"S Li","year":"2012","unstructured":"Li S, Gao F, Ge G, Zhang S (2012) Deterministic construction of compressed sensing matrices via algebraic curves. IEEE Trans Inf Theory 58(8):5035\u20135041","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"68_CR23","doi-asserted-by":"crossref","first-page":"2291","DOI":"10.1109\/TIT.2014.2303973","volume":"60","author":"S Li","year":"2014","unstructured":"Li S, Ge G (2014) Deterministic sensing matrices arising from near orthogonal systems. IEEE Trans Inf Theory 60(4):2291\u20132302","journal-title":"IEEE Trans Inf Theory"},{"issue":"11","key":"68_CR24","doi-asserted-by":"crossref","first-page":"2850","DOI":"10.1109\/TSP.2014.2318139","volume":"62","author":"S Li","year":"2014","unstructured":"Li S, Ge G (2014) Deterministic construction of sparse sensing matrices via finite geometry. IEEE Trans Signal Process 62(11):2850\u20132859","journal-title":"IEEE Trans Signal Process"},{"key":"68_CR25","first-page":"176","volume":"15","author":"X Liu","year":"2016","unstructured":"Liu X, Jie Y (2016) New construction of deterministic compressed sensing matrices via singular linear spaces over finite fields. WSEAS Trans Math 15:176\u2013184","journal-title":"WSEAS Trans Math"},{"issue":"2","key":"68_CR26","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B Natarajan","year":"1995","unstructured":"Natarajan B (1995) Sparse approximate solutions to linear systems. SIAM J comput 24(2):227\u2013234","journal-title":"SIAM J comput"},{"issue":"3","key":"68_CR27","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"Needell D, Tropp J (2009) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comput Harmon Anal 26(3):301\u2013321","journal-title":"Appl Comput Harmon Anal"},{"issue":"3","key":"68_CR28","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1063-5203(03)00023-X","volume":"14","author":"T Strohmer","year":"2003","unstructured":"Strohmer T, Heath R (2003) Grassmannian frames with applications to coding and communication. Appl Comput Harmon Anal 14(3):257\u2013275","journal-title":"Appl Comput Harmon Anal"},{"issue":"10","key":"68_CR29","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J Troop","year":"2004","unstructured":"Troop J (2004) Greed is good: algorithmic result for sparse approximation. IEEE Trans Inf Theory 50(10):2231\u20132242","journal-title":"IEEE Trans Inf Theory"},{"issue":"12","key":"68_CR30","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J Tropp","year":"2007","unstructured":"Tropp J, Gilbert A (2007) Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans Inf Theory 53(12):4655\u20134666","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"68_CR31","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.sigpro.2005.05.029","volume":"86","author":"Y Tsaig","year":"2006","unstructured":"Tsaig Y, Donoho D (2006) Extensions of compressed sensing. Signal Process 86(3):549\u2013571","journal-title":"Signal Process"},{"key":"68_CR32","volume-title":"Geometry of classical groups over finite fields","author":"Z Wan","year":"2002","unstructured":"Wan Z (2002) Geometry of classical groups over finite fields, 2nd edn. Science, Beijing","edition":"2"},{"key":"68_CR33","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejc.2009.01.002","volume":"31","author":"K Wang","year":"2010","unstructured":"Wang K, Guo J, Li F (2010) Association schemes based on attenuated spaces. Eur J Combin 31:297\u2013305","journal-title":"Eur J Combin"},{"key":"68_CR34","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ffa.2011.02.001","volume":"17","author":"K Wang","year":"2011","unstructured":"Wang K, Guo J, Li F (2011) Singular linear space and its applications. Finite Fields Appl 17:395\u2013406","journal-title":"Finite Fields Appl"},{"issue":"3","key":"68_CR35","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TIT.1974.1055219","volume":"20","author":"L Welch","year":"1974","unstructured":"Welch L (1974) Lower bounds on the maximum cross correlation of signals. IEEE Trans Inf Theory 20(3):397\u2013399","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"68_CR36","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0003-4916(89)90322-9","volume":"191","author":"W Wootters","year":"1989","unstructured":"Wootters W, Fields B (1989) Optimal state determination by mutually unbiased measurements. Ann Phys 191(2):363\u2013381","journal-title":"Ann Phys"},{"key":"68_CR37","unstructured":"Xu L, Chen H (2015) Deterministic construction of RIP matrices in compressed sensing from constant weight codes. ScienceWISE, arXiv:1506.02568 . Accessed 12 Jun 2015"},{"issue":"11","key":"68_CR38","doi-asserted-by":"crossref","first-page":"1960","DOI":"10.1109\/LSP.2015.2447934","volume":"22","author":"J Zhang","year":"2015","unstructured":"Zhang J, Han G, Fang Y (2015) Deterministic construction of compressed sensing matrices from protograph LDPC codes. IEEE Trans Signal Process Lett 22(11):1960\u20131964","journal-title":"IEEE Trans Signal Process Lett"},{"issue":"2","key":"68_CR39","doi-asserted-by":"crossref","first-page":"961","DOI":"10.3233\/IFS-141378","volume":"28","author":"Y Zheng","year":"2015","unstructured":"Zheng Y, Jeon B, Xu D, Wu QM, Zhang H (2015) Image segmentation by generalized hierarchical fuzzy C-means algorithm. J Intell Fuzzy Syst 28(2):961\u2013973","journal-title":"J Intell Fuzzy Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0068-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0068-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0068-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0068-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T20:21:23Z","timestamp":1692476483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0068-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,23]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["68"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0068-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,23]]}}}