{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T20:35:58Z","timestamp":1768768558752,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0747-7171(02)00131-1","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T07:46:23Z","timestamp":1045035983000},"page":"177-194","source":"Crossref","is-referenced-by-count":13,"title":["On the Gr\u00f6bner bases of some symmetric systems and their application to coding theory"],"prefix":"10.1016","volume":"35","author":[{"given":"Teo","family":"Mora","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(02)00131-1_B1","unstructured":"Alonso, M.E., Marinari, M.G., Mora, M.T., 2002. The big mother of all the dualities, I: moeller algorithm. Commun. Alg. (to appear)"},{"key":"10.1016\/S0747-7171(02)00131-1_B2","series-title":"Handbook of Coding Theory","first-page":"649","article-title":"Complexity issues in coding theory","author":"Barg","year":"1998"},{"key":"10.1016\/S0747-7171(02)00131-1_B3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s002000200097","article-title":"The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gr\u00f6bner shape theorem","volume":"13","author":"Caboara","year":"2002","journal-title":"AAECC"},{"key":"10.1016\/S0747-7171(02)00131-1_B4","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/18.333885","article-title":"Use of Gr\u00f6bner bases to decode binary cyclic codes up to the true minimum distance","volume":"40","author":"Chen","year":"1994","journal-title":"IEEE Trans. on Inf. Theorem"},{"key":"10.1016\/S0747-7171(02)00131-1_B5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/conm\/168\/01685","article-title":"Algebraic decoding of cyclic codes: a polynomial ideal point of view","volume":"168","author":"Chen","year":"1994","journal-title":"Contemp. Math."},{"key":"10.1016\/S0747-7171(02)00131-1_B6","doi-asserted-by":"crossref","first-page":"1290","DOI":"10.1109\/18.412677","article-title":"On the key equation","volume":"41","author":"Fitzpatrick","year":"1995","journal-title":"IEEE Trans. Inf. Theorem"},{"key":"10.1016\/S0747-7171(02)00131-1_B7","doi-asserted-by":"crossref","unstructured":"Giusti, M., 1984. Some effectivity problems in polynomial ideal theory. Proceedings EUROSAM \u201984, Lecture Notes in Computer Science, vol. 174. Springer, Berlin, pp. 159\u2013171","DOI":"10.1007\/BFb0032839"},{"key":"10.1016\/S0747-7171(02)00131-1_B8","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/18.651049","article-title":"Spectra of long primitive BCH codes cannot approach the binomial distribution","volume":"44","author":"Lazic","year":"1998","journal-title":"IEEE Trans. Inf. Theorem"},{"key":"10.1016\/S0747-7171(02)00131-1_B9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s002000050084","article-title":"On the decoding of cyclic codes using Gr\u00f6bner bases","volume":"8","author":"Loustaunau","year":"1997","journal-title":"AAECC"},{"key":"10.1016\/S0747-7171(02)00131-1_B10","series-title":"Symmetric functions and Hall polynomials","author":"MacDonald","year":"1995"},{"key":"10.1016\/S0747-7171(02)00131-1_B11","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1997"},{"key":"10.1016\/S0747-7171(02)00131-1_B12","unstructured":"MAGMA, Available from http:\/\/www.maths.usyd.edu.au:8000\/u\/magma\/"},{"key":"10.1016\/S0747-7171(02)00131-1_B13","unstructured":"MEDICIS, Available from http:\/\/www.medicis.polytechnique.fr"},{"key":"10.1016\/S0747-7171(02)00131-1_B14","doi-asserted-by":"crossref","unstructured":"Mora, F., Moeller, H.M., 1984. Upper and lower bounds for the degree of Gr\u00f6bner bases. Proceedings EUROSAM \u201984, Lecture Notes in Computer Science, vol. 174. Springer, Berlin, pp. 172\u2013183","DOI":"10.1007\/BFb0032840"},{"key":"10.1016\/S0747-7171(02)00131-1_B15","unstructured":"POSSO, Available from http:\/\/posso.dm.unipi.it"},{"key":"10.1016\/S0747-7171(02)00131-1_B16","series-title":"Error Correcting Codes","author":"Peterson","year":"1972"},{"key":"10.1016\/S0747-7171(02)00131-1_B17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s002000200096","article-title":"Gr\u00f6bner bases and distance of cyclic codes","volume":"13","author":"Sala","year":"2002","journal-title":"AAECC"},{"key":"10.1016\/S0747-7171(02)00131-1_B18","unstructured":"Sala, M., 2002b. Gr\u00f6bner bases and concentrated solutions for binary BCH codes with designed distance 9, Poster Presented at Symbolic Computational Algebra 2002, London, Canada"},{"key":"10.1016\/S0747-7171(02)00131-1_B19","unstructured":"Sala, M., 2002c. Gr\u00f6bner bases, accelerator polynomials and binary cyclic codes with coincident distances, Department of Mathematics, University of Pisa (preprint)"},{"key":"10.1016\/S0747-7171(02)00131-1_B20","unstructured":"Sala, M., Academic year 1999\/2000. On Some Algebraic Methods in the Theory of Error Correcting Codes, Ph.D. Thesis in Mathematics, University of Milan, Italy"},{"key":"10.1016\/S0747-7171(02)00131-1_B21","first-page":"14","article-title":"Weight spectrum of binary BCH codes","volume":"7","author":"Sidelnikov","year":"1971","journal-title":"Probl. Pereda Inf."},{"key":"10.1016\/S0747-7171(02)00131-1_B22","unstructured":"Traverso, C., 1992. Natural representation of algebraic numbers. Informal talk at MEGA-92, Nice"},{"key":"10.1016\/S0747-7171(02)00131-1_B23","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.641542","article-title":"The intractibility of computing the minimum distance of a code","volume":"43","author":"Vardy","year":"1997","journal-title":"IEEE Trans. Inf. Theorem"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001311?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001311?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T14:27:16Z","timestamp":1584023236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717102001311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0747717102001311"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(02)00131-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}