{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:23:00Z","timestamp":1783102980426,"version":"3.54.6"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2012,5,11]],"date-time":"2012-05-11T00:00:00Z","timestamp":1336694400000},"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":[[2013,1]]},"DOI":"10.1007\/s10623-012-9680-8","type":"journal-article","created":{"date-parts":[[2012,5,10]],"date-time":"2012-05-10T07:01:52Z","timestamp":1336633312000},"page":"195-220","source":"Crossref","is-referenced-by-count":36,"title":["Weighted Reed\u2013Muller codes revisited"],"prefix":"10.1007","volume":"66","author":[{"given":"Olav","family":"Geil","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Casper","family":"Thomsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,5,11]]},"reference":[{"key":"9680_CR1","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ffa.2006.12.004","volume":"14","author":"H.E. Andersen","year":"2008","unstructured":"Andersen H.E., Geil O.: Evaluation codes from order domain theory. Finite Fields Th. App. 14, 92\u2013123 (2008)","journal-title":"Finite Fields Th. App."},{"key":"9680_CR2","unstructured":"Augot D., El-Khamy M., McEliece R.J., Parvaresh F., Stepanov M., Vardy A.: List decoding of Reed\u2013 Solomon product codes. In: Proceedings of the Tenth International Workshop on Algebraic and Combinatorial Coding Theory, pp. 210\u2013213. Zvenigorod (2006)."},{"key":"9680_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/978-3-540-93806-4_27","volume-title":"Gr\u00f6bner Bases, Coding, and Cryptography","author":"D. Augot","year":"2009","unstructured":"Augot D., Stepanov M.: A note on the generalisation of the Guruswami\u2013Sudan list decoding algorithm to Reed\u2013Muller codes. In: Mora, L., Sala, M., Sakata, S., Perret, L., Traverso, C. (eds.) Gr\u00f6bner Bases, Coding, and Cryptography, pp. 395\u2013398. Springer, Berlin (2009)"},{"key":"9680_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.3934\/amc.2010.4.485","volume":"4","author":"P. Beelen","year":"2010","unstructured":"Beelen P., Brander K.: Efficient list decoding of a class of algebraic-geometry codes. Adv. Math. Commun. 4, 485\u2013518 (2010)","journal-title":"Adv. Math. Commun."},{"issue":"4","key":"9680_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"R.A. DeMillo","year":"1978","unstructured":"DeMillo R.A., Lipton R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978)","journal-title":"Inf. Process. Lett."},{"key":"9680_CR6","unstructured":"Dvir Z., Kopparty S., Saraf S., Sudan M.: Extensions to the method of multiplicities, with applications to Kakeya sets and Mergers, (appeared in Proc. of FOCS 2009) arXiv:0901.2529v2, p. 26 (2009)."},{"key":"9680_CR7","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/18.335972","volume":"40","author":"G.-L. Feng","year":"1994","unstructured":"Feng G.-L., Rao T.R.N.: A simple approach for construction of algebraic-geometric codes from affine plane curves. IEEE Trans. Inf. Theory 40, 1003\u20131012 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR8","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1109\/18.476241","volume":"41","author":"G.-L. Feng","year":"1995","unstructured":"Feng G.-L., Rao T.R.N.: Improved geometric Goppa codes, Part I: basic theory. IEEE Trans. Inf. Theory 41, 1678\u20131693 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR9","doi-asserted-by":"crossref","unstructured":"Geil O., H\u00f8holdt, T.: On hyperbolic codes. Proc. AAECC-14, Lecture Notes in Comput. Sci. 2227, 159\u2013171 (2001).","DOI":"10.1007\/3-540-45624-4_17"},{"key":"9680_CR10","unstructured":"Geil O., Matsumoto R.: Generalized Sudan\u2019s list decoding for order domain codes. Proc. AAECC-16, Lecture Notes in Comput. Sci., 4851, pp. 50\u201359. Springer, Berlin (2007)."},{"key":"9680_CR11","unstructured":"Geil O., Thomsen C.: Tables for numbers of zeros with multiplicity at least r, webpage: http:\/\/zeros.spag.dk , January 18th (2011)."},{"key":"9680_CR12","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami V., Sudan M.: Improved decoding of Reed\u2013Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45, 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00200-002-0106-0","volume":"13","author":"J.P. Hansen","year":"2002","unstructured":"Hansen J.P.: Toric varieties Hirzebruch surfaces and error-correcting codes. Appl. Algebra Eng. Comm. Comput. 13, 289\u2013300 (2002)","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"9680_CR14","first-page":"871","volume-title":"Handbook of Coding Theory. vol. 1","author":"T. H\u00f8holdt","year":"1998","unstructured":"H\u00f8holdt T., van Lint J., Pellikaan R.: Algebraic geometry codes, Chap. 10. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory. vol. 1, pp. 871\u2013961. Elsevier, Amsterdam (1998)"},{"key":"9680_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s00200-004-0152-x","volume":"15","author":"D. Joyner","year":"2004","unstructured":"Joyner D.: Toric codes over finite fields. Appl. Algebra Eng. Comm. Comput. 15, 63\u201379 (2004)","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"9680_CR16","unstructured":"Kabatiansky G.: Two Generalizations of prcduct Codes. Proc. of Acad. Sci. USSR, Cybern. Theory Regul. 232, vol. 6, pp. 1277\u20131280 (1977)."},{"key":"9680_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T. Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.: New generalizations of the Reed\u2013Muller codes. I. Primitive codes. IEEE Trans. Inf. Theory 14, 189\u2013199 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR18","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/050637054","volume":"20","author":"J. Little","year":"2007","unstructured":"Little J., Schenck H.: Toric surface codes and Minkowski sums. SIAM J. Discret. Math. 20, 999\u20131014 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"9680_CR19","volume-title":"Introduction to finite fields and their applications","author":"R. Lidl","year":"1986","unstructured":"Lidl R., Niederreiter H.: Introduction to finite fields and their applications. University of Cambridge Press, New York (1986)"},{"key":"9680_CR20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.1973.1054936","volume":"19","author":"J. Massey","year":"1973","unstructured":"Massey J., Costello D.J., Justesen J.: Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19, 101\u2013110 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR21","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/TIT.2004.825043","volume":"50","author":"R. Pellikaan","year":"2004","unstructured":"Pellikaan R., Wu X.-W.: List decoding of q-ary Reed\u2013Muller codes. IEEE Trans. Inf. Theory 50, 679\u2013682 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR22","unstructured":"Pellikaan R., Wu X.-W.: List decoding of q-ary Reed\u2013Muller codes. (Expanded version of the paper [21]), available from http:\/\/win.tue.nl\/~ruudp\/paper\/43-exp.pdf , p. 37 (2004)."},{"key":"9680_CR23","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.ffa.2007.02.002","volume":"13","author":"D. Ruano","year":"2007","unstructured":"Ruano D.: On the parameters of r-dimensional toric codes. Finite Fields and their Applications 13, 962\u2013976 (2007)","journal-title":"Finite Fields and their Applications"},{"key":"9680_CR24","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.jsc.2007.07.018","volume":"44","author":"D. Ruano","year":"2009","unstructured":"Ruano D.: On the structure of generalized toric codes. J. Symb. Comput. 44, 499\u2013506 (2009)","journal-title":"J. Symb. Comput."},{"key":"9680_CR25","unstructured":"Santhi N.: On algebraic decoding of q-ary Reed\u2013Muller and product-Reed\u2013Solomon codes. In: Proc. IEEE Int. Symp. Inf. Th., Nice, pp. 1351\u20131355 (2007)."},{"issue":"4","key":"9680_CR26","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27(4), 701\u2013717 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9680_CR27","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.1109\/18.165459","volume":"38","author":"A.B. S\u00f8rensen","year":"1992","unstructured":"S\u00f8rensen A.B.: Weighted Reed\u2013Muller codes and algebraic-geometric codes. IEEE Trans. Inf. Theory 38, 1821\u20131826 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9680_CR28","unstructured":"Wu X.-W.: An algorithm for finding the roots of the polynomials over order domains. In: Proc. of 2002, IEEE Int. Symp. Inf. Th., Lausanne (2002)."},{"key":"9680_CR29","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. Proc. of EUROSAM 1979, Lecture Notes in Comput. Sci., 72. Springer, Berlin, p. 216\u2013226 (1979)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9680-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9680-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9680-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T13:23:19Z","timestamp":1561728199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9680-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,11]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9680"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9680-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,11]]}}}