{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:44:03Z","timestamp":1648892643328},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T00:00:00Z","timestamp":1358294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10623-012-9793-0","type":"journal-article","created":{"date-parts":[[2013,1,15]],"date-time":"2013-01-15T15:40:39Z","timestamp":1358264439000},"page":"609-625","source":"Crossref","is-referenced-by-count":0,"title":["Skeleton simplicial evaluation codes"],"prefix":"10.1007","volume":"72","author":[{"given":"James","family":"Berg","sequence":"first","affiliation":[]},{"given":"Max","family":"Wakefield","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,16]]},"reference":[{"key":"9793_CR1","unstructured":"Athanasiadis C.A.: Characteristic polynomials of subspace arrangements and finite fields. Adv. Math. 122(2), 193\u2013233 (1996)."},{"key":"9793_CR2","unstructured":"Bj\u00f6rner A.: Subspace arrangements, First European Congress of Mathematics, vol. I. Paris (1992), Progr. Math., vol. 119, pp. 321\u2013370. Birkh\u00e4user, Basel (1994)."},{"key":"9793_CR3","doi-asserted-by":"crossref","unstructured":"Calderbank A.R., Cameron P.J., Kantor W.M., Seidel J.J.: $$Z_4$$ -Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets. Proc. London Math. Soc. (3) 75(2), 436\u2013480 (1997).","DOI":"10.1112\/S0024611597000403"},{"key":"9793_CR4","doi-asserted-by":"crossref","unstructured":"Cox D., Little J., O\u2019Shea D.: Using algebraic geometry. In: Graduate Texts in Mathematics, vol. 185. Springer, New York (1998).","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"9793_CR5","unstructured":"Duursma I.M., Renter\u00eda C., Tapia-Recillas H.: Reed\u2013Muller codes on complete intersections. Appl. Algebra Eng. Commun. Comput. 11(6), 455\u2013462 (2001)."},{"key":"9793_CR6","doi-asserted-by":"crossref","unstructured":"Geil O., Pellikaan R.: On the structure of order domains. Finite Fields Appl. 8(3), 369\u2013396 (2002).","DOI":"10.1006\/ffta.2001.0347"},{"key":"9793_CR7","unstructured":"Gold L., Little J., Schenck H.: Cayley-Bacharach and evaluation codes on complete intersections. J. Pure Appl. Algebra 196(1), 91\u201399 (2005)."},{"key":"9793_CR8","unstructured":"Hansen J.P.: Deligne-Lusztig varieties and group codes. In: Coding Theory and Algebraic Geometry. Luminy (1991), Lecture Notes in Mathematics, vol. 1518, pp. 63\u201381. Springer, Berlin (1992)."},{"key":"9793_CR9","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, New York (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"9793_CR10","unstructured":"Jurrius R., Pellikaan, R.: Codes, arrangements and matroids. In: Martinez-Moro E. (eds.) Series on Coding Theory and Cryptology, vol. 8. Algebraic Geometry Modeling in Information Theory, p. 300. World Scientific (2012)."},{"key":"9793_CR11","doi-asserted-by":"crossref","unstructured":"O\u2019Sullivan M.E.: New codes for the Berlekamp-Massey-Sakata algorithm. Finite Fields Appl. 7(2), 293\u2013317 (2001).","DOI":"10.1006\/ffta.2000.0283"},{"key":"9793_CR12","unstructured":"Sch\u00fcrer R., Schmid, W.C.: MinT: a database for optimal net parameters. In: Monte Carlo and Quasi-Monte Carlo Methods 2004, pp. 457\u2013469. Springer, Berlin (2006)."},{"key":"9793_CR13","unstructured":"Stanley R.P.: Combinatorics and commutative algebra, 2nd edn. Progress in Mathematics, vol. 41. Birkh\u00e4user Boston Inc., Boston (1996)."},{"key":"9793_CR14","unstructured":"Stein W.A. et al.: Sage Mathematics Software (Version 5.0.1). The Sage Development Team (2012). http:\/\/www.sagemath.org ."},{"key":"9793_CR15","doi-asserted-by":"crossref","unstructured":"Toh\u01ceneanu \u015e.O.: Lower bounds on minimal distance of evaluation codes. Appl. Algebra Eng. Commun. Comput. 20(5\u20136), 351\u2013360 (2009).","DOI":"10.1007\/s00200-009-0102-8"},{"key":"9793_CR16","doi-asserted-by":"crossref","unstructured":"Toh\u01ceneanu \u015e.O.: On the de Boer-Pellikaan method for computing minimum distance. J. Symbolic Comput. 45(10), 965\u2013974 (2010).","DOI":"10.1016\/j.jsc.2010.06.021"},{"key":"9793_CR17","doi-asserted-by":"crossref","unstructured":"Tsfasman M.A., Vl\u0103du\u0163 S.G.: Algebraic-geometric codes. In: Mathematics and its Applications (Soviet Series), vol. 58. Kluwer Academic Publishers Group, Dordrecht (1991) (Translated from the Russian by the authors).","DOI":"10.1007\/978-94-011-3810-9"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9793-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9793-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9793-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T00:55:20Z","timestamp":1644108920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9793-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,16]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["9793"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9793-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,16]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-012-9793-0', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid884' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:884', '*');; return false;" style='text-decoration: none; '>Idea </a> <a style='color: white;' href='#diffid884'><sup>1</sup></a></div><div><a href='#diffid119' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:119', '*');; return false;" style='text-decoration: none; '>idea </a> <a style='color: white;' href='#diffid119'><sup>1</sup></a></div><div><a href='#diffid878' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:878', '*');; return false;" style='text-decoration: none; '>Note </a> <a style='color: white;' href='#diffid878'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>