{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:43Z","timestamp":1759335643818,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T00:00:00Z","timestamp":1537401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-CE39-0013-01"],"award-info":[{"award-number":["ANR-15-CE39-0013-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10623-018-0552-8","type":"journal-article","created":{"date-parts":[[2018,9,20]],"date-time":"2018-09-20T14:22:08Z","timestamp":1537453328000},"page":"1541-1575","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Lifted projective Reed\u2013Solomon codes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3688-5114","authenticated-orcid":false,"given":"Julien","family":"Lavauzelle","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"1\u20132","key":"552_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N.: Combinatorial nullstellensatz. Comb. Probab. Comput. 8(1\u20132), 7\u201329 (1999).","journal-title":"Comb. Probab. Comput."},{"key":"552_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"EF Assmus","year":"1992","unstructured":"Assmus E.F.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)."},{"issue":"5","key":"552_CR3","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1109\/18.995540","volume":"48","author":"TP Berger","year":"2002","unstructured":"Berger T.P.: Automorphism groups of homogeneous and projective Reed\u2013Muller codes. IEEE Trans. Inf. Theory 48(5), 1035\u20131045 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20133","key":"552_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(93)90321-J","volume":"117","author":"TP Berger","year":"1993","unstructured":"Berger T.P., Charpin P.: The automorphism group of generalized Reed\u2013Muller codes. Discret. Math. 117(1\u20133), 1\u201317 (1993).","journal-title":"Discret. Math."},{"key":"552_CR5","doi-asserted-by":"crossref","unstructured":"Berger, T.P., de\u00a0Maximy, L.: Cyclic projective Reed\u2013Muller Codes. In: Boztas, S., Shparlinski, I.E. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, November 26\u201330. Lecture Notes in Computer Science, vol. 2227, pp. 77\u201381, Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45624-4_8"},{"issue":"5","key":"552_CR6","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1109\/TIT.2016.2538766","volume":"62","author":"A Guo","year":"2016","unstructured":"Guo A., Kopparty S.: List-decoding algorithms for lifted codes. IEEE Trans. Inf. Theory 62(5), 2719\u20132725 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"552_CR7","doi-asserted-by":"crossref","unstructured":"Guo A., Kopparty S., Sudan M.: New affine-invariant codes from lifting. In: Kleinberg R.D. (ed.) Proceedings of the 4th conference on Innovations in Theoretical Computer Science, ITCS\u201913, pp. 529\u2013540. ACM, New York (2013)","DOI":"10.1145\/2422436.2422494"},{"issue":"3","key":"552_CR8","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1137\/S0097539704445615","volume":"36","author":"T Kaufman","year":"2006","unstructured":"Kaufman T., Ron D.: Testing polynomials over general fields. SIAM J. Comput. 36(3), 779\u2013802 (2006).","journal-title":"SIAM J. Comput."},{"key":"552_CR9","doi-asserted-by":"crossref","unstructured":"Kaufman ,T., Sudan, M.: Algebraic property testing: the role of invariance. In: Cynthia D., (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, May 17\u201320, pp. 403\u2013412. ACM, New York (2008)","DOI":"10.1145\/1374376.1374434"},{"issue":"5","key":"552_CR10","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2629416","volume":"61","author":"S Kopparty","year":"2014","unstructured":"Kopparty S., Saraf S., Yekhanin S.: High-rate codes with sublinear-time decoding. J. ACM 61(5), 28:1\u201328:20 (2014).","journal-title":"J. ACM"},{"key":"552_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Coding Theory and Applications","author":"G Lachaud","year":"1986","unstructured":"Lachaud G.: Projective Reed\u2013Muller codes. In: Cohen G., Godlewski P. (eds.) Coding Theory and Applications, vol. 311. Lecture Notes in Computer ScienceSpringer, Heidelberg (1986)."},{"issue":"2","key":"552_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(90)90155-B","volume":"81","author":"G Lachaud","year":"1990","unstructured":"Lachaud G.: The parameters of projective Reed-M\u00fcller codes. Discret. Math. 81(2), 217\u2013221 (1990).","journal-title":"Discret. Math."},{"key":"552_CR13","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1049\/piee.1979.0177","volume":"126","author":"IS Reed","year":"1979","unstructured":"Reed I.S., Truong T.-K., Miller R.L.: Simplified algorithm for correcting both errors and erasures of Reed\u2013Solomon codes. Inst. Electr. Eng. 126, 961\u2013963 (1979).","journal-title":"Inst. Electr. Eng."},{"issue":"2","key":"552_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/00927879708825862","volume":"25","author":"C Renter\u00eca","year":"1997","unstructured":"Renter\u00eca C., Tapia-Recillas H.: Reed\u2013Muller codes: an ideal theory approach. Commun. Algebra 25(2), 401\u2013413 (1997).","journal-title":"Commun. Algebra"},{"issue":"2","key":"552_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80046-3","volume":"7","author":"KJC Smith","year":"1969","unstructured":"Smith K.J.C.: On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry. J. Comb. Theory 7(2), 122\u2013129 (1969).","journal-title":"J. Comb. Theory"},{"issue":"6","key":"552_CR16","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1109\/18.104317","volume":"37","author":"AB S\u00f8rensen","year":"1991","unstructured":"S\u00f8rensen A.B.: Projective Reed\u2013Muller codes. IEEE Trans. Inf. Theory 37(6), 1567\u20131576 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"552_CR17","unstructured":"Stein, W.A., et al.: Sage Mathematics Software (Version 8.0) (2001)"},{"key":"552_CR18","volume-title":"Combinatorial Designs\u2014Constructions and Analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson D.R.: Combinatorial Designs\u2014Constructions and Analysis. Springer, New York (2004)."},{"issue":"3","key":"552_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1561\/0400000030","volume":"6","author":"S Yekhanin","year":"2012","unstructured":"Yekhanin S.: Locally decodable codes. Found. Trends Theor. Comput. Sci. 6(3), 139\u2013255 (2012).","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0552-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0552-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0552-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T07:48:55Z","timestamp":1693900135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0552-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,20]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["552"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0552-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2018,9,20]]},"assertion":[{"value":"20 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}