{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:51:14Z","timestamp":1772808674045,"version":"3.50.1"},"reference-count":16,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2016]]},"DOI":"10.3934\/amc.2016016","type":"journal-article","created":{"date-parts":[[2016,5,2]],"date-time":"2016-05-02T17:06:13Z","timestamp":1462208773000},"page":"429-436","source":"Crossref","is-referenced-by-count":0,"title":["Coherence of sensing matrices coming from algebraic-geometric codes"],"prefix":"10.3934","volume":"10","author":[{"given":"Seungkook","family":"Park","sequence":"first","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2016016-1","doi-asserted-by":"publisher","unstructured":"P. Beelen, The order bound for general algebraic geometric codes, Finite Fields Appl.<\/em>, 13<\/strong> (2007), 665-680.","DOI":"10.1016\/j.ffa.2006.09.006"},{"key":"key-10.3934\/amc.2016016-2","doi-asserted-by":"publisher","unstructured":"J. Bourgain, S. Dilworth, K. Ford, S. Konyagin and D. Kutzarova, Explicit constructions of RIP matrices and related problems, Duke Math. J.<\/em>, 159<\/strong> (2011), 145-185.","DOI":"10.1215\/00127094-1384809"},{"key":"key-10.3934\/amc.2016016-3","doi-asserted-by":"publisher","unstructured":"E. J. Cand\u00e8s, J. Romberg and T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inf. Theory<\/em>, 52<\/strong> (2006), 489-509.","DOI":"10.1109\/TIT.2005.862083"},{"key":"key-10.3934\/amc.2016016-4","doi-asserted-by":"publisher","unstructured":"E. J. Cand\u00e8s and T. Tao, Decoding by linear programming, IEEE Trans. Inf. Theory<\/em>, 51<\/strong> (2005), 4203-4215.","DOI":"10.1109\/TIT.2005.858979"},{"key":"key-10.3934\/amc.2016016-5","doi-asserted-by":"publisher","unstructured":"R. A. DeVore, Deterministic constructions of compressed sensing matrices, J. Complexity<\/em>, 23<\/strong> (2007), 918-925.","DOI":"10.1016\/j.jco.2007.04.002"},{"key":"key-10.3934\/amc.2016016-6","doi-asserted-by":"publisher","unstructured":"D. L. Donoho, Compressed sensing, IEEE Trans. Inf. Theory<\/em>, 52<\/strong> (2006), 1289-1306.","DOI":"10.1109\/TIT.2006.871582"},{"key":"key-10.3934\/amc.2016016-7","doi-asserted-by":"publisher","unstructured":"M. Homma and S. J. Kim, Toward the determination of the minimum distance of two-point codes on a Hermitian curve, Des. Codes Crypt.<\/em>, 37<\/strong> (2005), 111-132.","DOI":"10.1007\/s10623-004-3807-5"},{"key":"key-10.3934\/amc.2016016-8","doi-asserted-by":"publisher","unstructured":"M. Homma and S. J. Kim, The complete determination of the minimum distance of two-point codes on a Hermitian curve, Des. Codes Crypt.<\/em>, 40<\/strong> (2006), 5-24.","DOI":"10.1007\/s10623-005-4599-y"},{"key":"key-10.3934\/amc.2016016-9","doi-asserted-by":"publisher","unstructured":"M. Homma and S. J. Kim, The two-point codes on a Hermitian curve with the designed minimum distance, Des. Codes Crypt.<\/em>, 38<\/strong> (2006), 55-81.","DOI":"10.1007\/s10623-004-5661-x"},{"key":"key-10.3934\/amc.2016016-10","doi-asserted-by":"publisher","unstructured":"M. Homma and S. J. Kim, The two-point codes with the designed distance on a Hermitian curve in even characteristic, Des. Codes Crypt.<\/em>, 39<\/strong> (2006), 375-386.","DOI":"10.1007\/s10623-005-5471-9"},{"key":"key-10.3934\/amc.2016016-11","doi-asserted-by":"publisher","unstructured":"C. Kirfel and R. Pellikaan, The minimum distance of codes in an array coming from telescopic semigroups, IEEE Trans. Inf. Theory<\/em>, 41<\/strong> (1995), 1720-1732.","DOI":"10.1109\/18.476245"},{"key":"key-10.3934\/amc.2016016-12","doi-asserted-by":"publisher","unstructured":"S. Li, F. Gao, G. Ge and S. Zhang, Deterministic construction of compressed sensing matrices via algebraic curves, IEEE Trans. Inf. Theory<\/em>, 58<\/strong> (2012), 5035-5041.","DOI":"10.1109\/TIT.2012.2196256"},{"key":"key-10.3934\/amc.2016016-13","doi-asserted-by":"publisher","unstructured":"G. L. Matthews, Weierstrass pairs and minimum distance of Goppa codes, Des. Codes Crypt.<\/em>, 22<\/strong> (2001), 107-121.","DOI":"10.1023\/A:1008311518095"},{"key":"key-10.3934\/amc.2016016-14","doi-asserted-by":"publisher","unstructured":"S. Park, Minimum distance of Hermitian two-point codes, Des. Codes Crypt.<\/em>, 57<\/strong> (2010), 195-213.","DOI":"10.1007\/s10623-009-9361-4"},{"key":"key-10.3934\/amc.2016016-15","doi-asserted-by":"crossref","unstructured":"H. Stichtenoth, Algebraic Function Fields and Codes<\/em>, 2nd edition, Springer-Verlag, Berlin, 2009.","DOI":"10.1007\/978-3-540-76878-4"},{"key":"key-10.3934\/amc.2016016-16","doi-asserted-by":"publisher","unstructured":"C. P. Xing and H. Chen, Improvements on parameters of one-point AG codes from Hermitian curves, IEEE Trans. Inf. Theory<\/em>, 48<\/strong> (2002), 535-537.","DOI":"10.1109\/18.979330"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.aimsciences.org\/journals\/displayArticlesnew.jsp?paperID=12530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:06:11Z","timestamp":1772791571000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2016016"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2016016","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}