{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:26:55Z","timestamp":1740108415406,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00200-020-00427-x","type":"journal-article","created":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T07:02:20Z","timestamp":1587193340000},"page":"215-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["HELP: a sparse error locator polynomial for BCH codes"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6059-9930","authenticated-orcid":false,"given":"Michela","family":"Ceria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8176-4368","authenticated-orcid":false,"given":"Teo","family":"Mora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7266-5146","authenticated-orcid":false,"given":"Massimiliano","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"issue":"6","key":"427_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00200-006-0019-4","volume":"17","author":"ME Alonso","year":"2006","unstructured":"Alonso, M.E., Marinari, M.G., Mora, T.: The big Mother of all Dualities 2: Macaulay Bases. Appl. Algebra Eng. Commun. Comput. Arch. 17(6), 409\u2013451 (2006)","journal-title":"Appl. Algebra Eng. Commun. Comput. Arch."},{"key":"427_CR2","first-page":"362","volume":"2003","author":"D Augot","year":"2003","unstructured":"Augot, D., Bardet, M., Faug\u00e8re, J.-C.: Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Groebner bases. Proc. ISIT 2003, 362 (2003)","journal-title":"Proc. ISIT"},{"key":"427_CR3","first-page":"2646","volume":"2007","author":"D Augot","year":"2007","unstructured":"Augot, D., Bardet, M., Faug\u00e8re, J.-C.: On formulas for decoding binary cyclic codes. Proc. ISIT 2007, 2646\u20132650 (2007)","journal-title":"Proc. ISIT"},{"key":"427_CR4","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"issue":"3","key":"427_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s002000200097","volume":"13","author":"M Caboara","year":"2002","unstructured":"Caboara, M., Mora, T.: The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Groebner shape theorem. Appl. Algebra Eng. Commun. Comput. 13(3), 209\u2013232 (2002)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"427_CR6","doi-asserted-by":"publisher","first-page":"3641","DOI":"10.1109\/TIT.2017.2692213","volume":"63.6","author":"F Caruso","year":"2017","unstructured":"Caruso, F., Orsini, E., Tinnirello, C., Sala, M.: On the shape of the general error locator polynomial for cyclic codes. IEEE Trans. Inf. Theory 63.6, 3641\u20133657 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3\u20134","key":"427_CR7","first-page":"213","volume":"72","author":"M Ceria","year":"2014","unstructured":"Ceria, M.: A proof of the \u201cAxis of Evil theorem\u201d for distinct points. Rendiconti del Seminario Matematico dell\u2019Universit\u00e0 e del Politecnico di Torino 72(3\u20134), 213\u2013233 (2014)","journal-title":"Rendiconti del Seminario Matematico dell\u2019Universit\u00e0 e del Politecnico di Torino"},{"key":"427_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jsc.2018.06.012","volume":"91","author":"M Ceria","year":"2019","unstructured":"Ceria, M.: Bar Code for monomial ideals. J. Symb. Comput. 91, 30\u201356 (2019)","journal-title":"J. Symb. Comput."},{"unstructured":"Ceria, M., Mora, T.: Combinatorics of ideals of points: a Cerlienco-Mureddu-like approach for an iterative lex game, arXiv preprint, arXiv:1805.09165 [math.AC]","key":"427_CR9"},{"unstructured":"Ceria, M.: Half error locator polynomials for efficient decoding of binary cyclic codes, in preparation","key":"427_CR10"},{"unstructured":"Ceria, M.: Macaulay, Lazard and the syndrome variety, arxiv preprint arXiv:1910.13189 [math.CO]","key":"427_CR11"},{"unstructured":"Ceria, M., Mora, T., Sala, M.: Zech tableaux as tools for sparse decoding. Accepted by Rendiconti del Seminario Matematico, ISSN: 0373-1243","key":"427_CR12"},{"key":"427_CR13","first-page":"39","volume":"24","author":"L Cerlienco","year":"1990","unstructured":"Cerlienco, L., Mureddu, M.: Algoritmi combinatori per l\u2019interpolazione polinomiale in dimensione $$\\ge 2$$. S\u00e9minaire Lotharingien de Combinatoire 24, 39\u201376 (1990)","journal-title":"S\u00e9minaire Lotharingien de Combinatoire"},{"key":"427_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0012-365X(94)00126-4","volume":"139","author":"L Cerlienco","year":"1995","unstructured":"Cerlienco, L., Mureddu, M.: From algebraic sets to monomial linear bases by means of combinatorial algorithms. Discrete Math. 139, 73\u201387 (1995)","journal-title":"Discrete Math."},{"key":"427_CR15","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1006\/jabr.2001.9061","volume":"251","author":"L Cerlienco","year":"2002","unstructured":"Cerlienco, L., Mureddu, M.: Multivariate interpolation and standard bases for Macaulay modules. J. Algebra 251, 686\u2013726 (2002)","journal-title":"J. Algebra"},{"key":"427_CR16","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1109\/18.333886","volume":"40","author":"X Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, T.K.: General principles for the algebraic decoding of cyclic codes. EEE Trans. Inf. Theory 40, 1661\u20131663 (1994a)","journal-title":"EEE Trans. Inf. Theory"},{"issue":"5","key":"427_CR17","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/18.333885","volume":"40","author":"X Chen","year":"1994","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, T.K.: Use of Groebner bases to decode binary cyclic codes up to the true minimum distance. IEEE Trans. Inf. Theory 40(5), 1654\u20131661 (1994c)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Chen, X., Reed, I.S., Helleseth, T., Truong, T.K.: Algebraic decoding of cyclic codes: a polynomial ideal point of view. Contemp. Math. Amer. Math. Soc. 168, 15\u201322 (1994b)","key":"427_CR18","DOI":"10.1090\/conm\/168\/01685"},{"unstructured":"Cooper III, A.B.: Direct solution of BCH syndrome equations. In: Arkian, E. (Ed.) Communications, Control, and Signal Processing, Elsevier, pp. 281\u2013286 (1990)","key":"427_CR19"},{"issue":"22","key":"427_CR20","first-page":"090","volume":"27","author":"AB III Cooper","year":"1991","unstructured":"Cooper III, A.B.: Finding BCH error locator polynomials in one step. Electron. Lett. 27(22), 2090\u20132091 (1991)","journal-title":"Electron. Lett."},{"key":"427_CR21","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.jsc.2005.11.003","volume":"41","author":"B Felszeghy","year":"2006","unstructured":"Felszeghy, B., R\u00e1th, B., R\u00f3nyai, L.: The lex game and some applications. J. Symb. Comput. 41, 663\u2013681 (2006)","journal-title":"J. Symb. Comput."},{"key":"427_CR22","first-page":"293","volume":"378","author":"P Gianni","year":"1987","unstructured":"Gianni, P.: Properties of Gr\u00f6bner bases under specialization. L. N. Comp. Sci. 378, 293\u2013297 (1987)","journal-title":"L. N. Comp. Sci."},{"key":"427_CR23","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2010","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2010)"},{"key":"427_CR24","first-page":"282","volume":"378","author":"M Kalkbrenner","year":"1987","unstructured":"Kalkbrenner, M.: Solving systems of algebraic equations by using Groebner bases. L. N. Comp. Sci. 378, 282\u2013292 (1987)","journal-title":"L. N. Comp. Sci."},{"key":"427_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jsco.1997.0113","volume":"24","author":"M Kalkbrenner","year":"1997","unstructured":"Kalkbrenner, M.: On the stability of Gr\u00f6bner Bases under specialization. J. Symb. Comp. 24, 51\u201358 (1997)","journal-title":"J. Symb. Comp."},{"key":"427_CR26","volume-title":"Finite Fields, Volume 20, Parte 1 Volume 20 di Encyclopedia of Mathematics and its Applications,","author":"R Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, Volume 20, Parte 1 Volume 20 di Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge (1997)"},{"issue":"6","key":"427_CR27","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s002000050084","volume":"8","author":"P Loustaunau","year":"1997","unstructured":"Loustaunau, P., York, E.V.: On the decoding of cyclic codes using Gr\u00f6bner bases. AAECC 8(6), 469\u2013483 (1997)","journal-title":"AAECC"},{"issue":"4","key":"427_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.jpaa.2009.05.013","volume":"214","author":"S Lundqvist","year":"2010","unstructured":"Lundqvist, S.: Vector space bases associated to vanishing ideals of points. J. Pure Appl. Algebra 214(4), 309\u2013321 (2010)","journal-title":"J. Pure Appl. Algebra"},{"key":"427_CR29","volume-title":"Groebner Bases, Coding, and Cryptography","author":"T Mora","year":"2009","unstructured":"Mora, T., Perret, L., Sakata, S., Sala, M., Traverso, C.: Groebner Bases, Coding, and Cryptography. Springer, Berlin (2009)"},{"key":"427_CR30","first-page":"62","volume-title":"Groebner Bases, Coding, and Cryptography","author":"E Orsini","year":"2009","unstructured":"Orsini, E., Mora, T.: Decoding cyclic codes: the Cooper Philosophy. In: Sala, M. (ed.) Groebner Bases, Coding, and Cryptography, pp. 62\u201392. Springer, Berlin (2009)"},{"unstructured":"Mora, T., Orsini, E., Sala, M.: General error locator polynomials for binary cyclic codes with $$t \\le 2$$ and $$n < 63$$, BCRI preprint, 43, UCC, Cork, Ireland. http:\/\/www.bcri.ucc.ie\/FILES\/PUBS\/BCRI_44.pdf (2006). Accessed 10 Apr 2020","key":"427_CR31"},{"key":"427_CR32","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.jpaa.2004.12.027","volume":"200","author":"E Orsini","year":"2005","unstructured":"Orsini, E., Sala, M.: Correcting errors and erasures via the syndrome variety. J. Pure Appl. Algebra 200, 191\u2013226 (2005)","journal-title":"J. Pure Appl. Algebra"},{"key":"427_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542831","volume-title":"Solving Polynomial Equation Systems 4 Vols","author":"T Mora","year":"2003","unstructured":"Mora, T.: Solving polynomial equation systems. I. The Kronecker-Duval philosophy. Cambridge University Press, Cambridge, pp. xiv+423 (2003)"},{"key":"427_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107340954","volume-title":"Solving Polynomial Equation Systems 4 Vols","author":"T Mora","year":"2005","unstructured":"Mora, T.: Solving polynomial equation systems. II. Macaulay's paradigm and Gr\u00f6bner technology. Cambridge University Press, Cambridge, pp. xxii+759 (2005)"},{"key":"427_CR35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139015998","volume-title":"Solving Polynomial Equation Systems 4 Vols","author":"T Mora","year":"2015","unstructured":"Mora, T.: Solving polynomial equation systems. Vol. III. Algebraic solving. Cambridge University Press, Cambridge, pp. xviii+275 (2015)"},{"key":"427_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316271902","volume-title":"Solving Polynomial Equation Systems 4 Vols","author":"T Mora","year":"2016","unstructured":"Mora, T.: Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond. Cambridge University Press, Cambridge, pp. xi+820 (2016)"},{"doi-asserted-by":"crossref","unstructured":"Mora, T.: An FGLM-like algorithm for computing the radical of a zero-dimensional ideal. Journal of Algebra and Its Applications 17(01), 1850002-1\u20131850002-17 (2018)","key":"427_CR37","DOI":"10.1142\/S0219498818500020"},{"key":"427_CR38","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.jsc.2004.11.010","volume":"39","author":"B Mourrain","year":"2005","unstructured":"Mourrain, B.: Bezoutian and quotient ring structure. J. Symb. Comp. 39, 397\u2013415 (2005)","journal-title":"J. Symb. Comp."},{"key":"427_CR39","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TIT.2006.889465","volume":"53","author":"E Orsini","year":"2007","unstructured":"Orsini, E., Sala, M.: General error locator polynomials for binary cyclic codes with $$t \\le 2$$ and $$n< 63$$. IEEE Trans. Inf. Theory 53, 1095\u20131107 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Peterson, W.W.: Encoding and error-correction procedures for the Bose-Chaudhuri codes. IEEE Trans. Inform. Theory, IT-6, 459\u2013470 (1960)","key":"427_CR40","DOI":"10.1109\/TIT.1960.1057586"},{"key":"427_CR41","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F Rouillier","year":"1999","unstructured":"Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. J. AAECC 9, 433\u2013461 (1999)","journal-title":"J. AAECC"},{"issue":"03","key":"427_CR42","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1142\/S0219498807002260","volume":"6","author":"M Sala","year":"2007","unstructured":"Sala, M.: Groebner basis techniques to compute weight distributions of shortened cyclic codes. J. Algebra Appl. 6(03), 403\u2013414 (2007)","journal-title":"J. Algebra Appl."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00427-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,17]],"date-time":"2021-04-17T23:13:40Z","timestamp":1618701220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00427-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,18]]},"references-count":42,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00427-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2020,4,18]]},"assertion":[{"value":"30 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}