{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T08:50:13Z","timestamp":1775292613569,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10623-018-0577-z","type":"journal-article","created":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T16:19:16Z","timestamp":1543681156000},"page":"589-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Improved power decoding of interleaved one-point Hermitian codes"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7474-2678","authenticated-orcid":false,"given":"Sven","family":"Puchinger","sequence":"first","affiliation":[]},{"given":"Johan","family":"Rosenkilde","sequence":"additional","affiliation":[]},{"given":"Irene","family":"Bouw","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,1]]},"reference":[{"key":"577_CR1","doi-asserted-by":"crossref","unstructured":"Armand M.A.: Interleaved Reed\u2013Solomon codes versus interleaved Hermitian codes. IEEE Commun. Lett. 12(10) (2008).","DOI":"10.1109\/LCOMM.2008.080716"},{"key":"577_CR2","unstructured":"Beckermann B., Labahn G.: A uniform approach for the fast computation of matrix-type pad\u00e9 approximants. SIAM J. Matrix Anal. Appl. 15(3), 804\u2013823 (1994). http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/S0895479892230031 ."},{"key":"577_CR3","unstructured":"Brander K.: Interpolation and list decoding of algebraic codes. PhD dissertation, PhD thesis, Technical University of Denmark (2010)."},{"key":"577_CR4","unstructured":"Brown A., Minder L., Shokrollahi A.: Improved decoding of interleaved AG codes. In: IMA International Conference on Cryptography and Coding, pp. 37\u201346. Springer, Berlin (2005)."},{"issue":"1","key":"577_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2140\/obs.2013.1.271","volume":"1","author":"H Cohn","year":"2013","unstructured":"Cohn H., Heninger N.: Approximate common divisors via lattices. Open Book Ser. 1(1), 271\u2013293 (2013).","journal-title":"Open Book Ser."},{"issue":"3","key":"577_CR6","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1109\/18.30981","volume":"35","author":"G-L Feng","year":"1989","unstructured":"Feng G.-L., Tzeng K.K.: A generalized euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inf. Theory 35(3), 584\u2013594 (1989).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"577_CR7","doi-asserted-by":"crossref","unstructured":"Guruswami V., Sudan M.: Improved decoding of Reed\u2013Solomon and algebraic-geometric codes. In: IEEE Annual Symposium on Foundations of Computer Science, pp. 28\u201337 (1998).","DOI":"10.1109\/SFCS.1998.743426"},{"key":"577_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S1571-0653(04)00181-7","volume":"6","author":"JP Hansen","year":"2001","unstructured":"Hansen J.P.: Dependent rational points on curves over finite fields-Lefschetz theorems and exponential sums. Electron. Notes Discret. Math. 6, 297\u2013309 (2001).","journal-title":"Electron. Notes Discret. Math."},{"key":"577_CR9","doi-asserted-by":"crossref","unstructured":"Jensen H.E., Nielsen R.R., H\u00f8holdt T.: Performance analysis of a decoding algorithm for algebraic geometry codes. In: IEEE International Symposium on Information Theory (1998).","DOI":"10.1109\/18.771253"},{"key":"577_CR10","unstructured":"Kampf S.: Decoding Hermitian codes: an engineering approach. PhD dissertation, Universit\u00e4t Ulm (2012)."},{"issue":"1\u20132","key":"577_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10623-012-9625-2","volume":"70","author":"S Kampf","year":"2014","unstructured":"Kampf S.: Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension. Des. Codes Cryptogr. 70(1\u20132), 9\u201325 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"577_CR12","doi-asserted-by":"publisher","first-page":"2740","DOI":"10.1109\/20.617715","volume":"33","author":"VY Krachkovsky","year":"1997","unstructured":"Krachkovsky V.Y., Lee Y.X.: Decoding for iterative Reed\u2013Solomon coding schemes. IEEE Trans. Magn. 33(5), 2740\u20132742 (1997).","journal-title":"IEEE Trans. Magn."},{"issue":"12","key":"577_CR13","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1016\/j.jsc.2007.12.004","volume":"44","author":"K Lee","year":"2009","unstructured":"Lee K., O\u2019Sullivan M.E.: List decoding of Hermitian codes using Gr\u00f6bner bases. J. Symb. Comput. 44(12), 1662\u20131675 (2009).","journal-title":"J. Symb. Comput."},{"issue":"4","key":"577_CR14","doi-asserted-by":"publisher","first-page":"2038","DOI":"10.1109\/TIT.2014.2306816","volume":"60","author":"K Lee","year":"2014","unstructured":"Lee K., Bras-Amoros M., O\u2019Sullivan M.: Unique decoding of general AG codes. IEEE Trans. Inf. Theory 60(4), 2038\u20132053 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"577_CR15","doi-asserted-by":"crossref","unstructured":"Nielsen J.S.R.: Generalised multi-sequence shift-register synthesis using module minimisation. In: IEEE International Symposium on Information Theory, pp. 882\u2013886 (2013). [Online]. http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=6620353 .","DOI":"10.1109\/ISIT.2013.6620353"},{"issue":"6","key":"577_CR16","doi-asserted-by":"publisher","first-page":"3225","DOI":"10.1109\/TIT.2015.2424415","volume":"61","author":"JSR Nielsen","year":"2015","unstructured":"Nielsen J.S.R., Beelen P.: Sub-quadratic decoding of one-point Hermitian codes. IEEE Trans. Inf. Theory 61(6), 3225\u20133240 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"577_CR17","unstructured":"Parvaresh F., Vardy A.: Multivariate interpolation decoding beyond the Guruswami\u2013Sudan radius. In: Proceedings of the 42nd Allerton Conference on Communication, Control and Computing (2004)."},{"key":"577_CR18","unstructured":"Puchinger S., Bouw I., Rosenkilde n\u00e9 Nielsen J.: Improved power decoding of one-point Hermitian codes. In: International Workshop on Coding and Cryptography (2017). arXiv:1703.07982 ."},{"key":"577_CR19","doi-asserted-by":"crossref","unstructured":"Puchinger S., Rosenkilde n\u00e9 Nielsen J.: Decoding of interleaved Reed\u2013Solomon codes using improved power decoding. In: IEEE International Symposium on Information Theory (2017).","DOI":"10.1109\/ISIT.2017.8006549"},{"key":"577_CR20","doi-asserted-by":"crossref","unstructured":"Rosenkilde J.: Power decoding Reed\u2013Solomon codes up to the Johnson radius. Accepted for: Advances in Mathematics of Communications (2018). arXiv:1505.02111 .","DOI":"10.3934\/amc.2018005"},{"key":"577_CR21","doi-asserted-by":"crossref","unstructured":"Schmidt G., Sidorenko V., Bossert M.: Enhancing the correcting radius of interleaved Reed\u2013Solomon decoding using syndrome extension techniques. In: IEEE ISIT, pp. 1341\u20131345 (2007).","DOI":"10.1109\/ISIT.2007.4557409"},{"issue":"7","key":"577_CR22","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1109\/TIT.2009.2021308","volume":"55","author":"G Schmidt","year":"2009","unstructured":"Schmidt G., Sidorenko V.R., Bossert M.: Collaborative decoding of interleaved Reed\u2013Solomon codes and concatenated code designs. IEEE Trans. Inf. Theory 55(7), 2991\u20133012 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"577_CR23","doi-asserted-by":"publisher","first-page":"5245","DOI":"10.1109\/TIT.2010.2060130","volume":"56","author":"G Schmidt","year":"2010","unstructured":"Schmidt G., Sidorenko V.R., Bossert M.: Syndrome decoding of Reed\u2013Solomon codes beyond half the minimum distance based on shift-register synthesis. IEEE Trans. Inf. Theory 56(10), 5245\u20135252 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"577_CR24","unstructured":"Sidorenko V., Schmidt G., Bossert M.: Decoding punctured Reed\u2013Solomon codes up to the singleton bound. In: International ITG Conference on Source and Channel Coding, pp. 1\u20136 (2008)."},{"key":"577_CR25","unstructured":"Stein W.A. et al.: SageMath Software. http:\/\/www.sagemath.org ."},{"issue":"2","key":"577_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10623-012-9728-9","volume":"71","author":"A Wachter-Zeh","year":"2014","unstructured":"Wachter-Zeh A., Zeh A., Bossert M.: Decoding interleaved Reed\u2013Solomon codes beyond their joint error-correcting capability. Des. Codes Cryptogr. 71(2), 261\u2013281 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"577_CR27","doi-asserted-by":"publisher","first-page":"3611","DOI":"10.1109\/TIT.2008.926355","volume":"54","author":"Y Wu","year":"2008","unstructured":"Wu Y.: New list decoding algorithms for Reed\u2013Solomon and BCH codes. IEEE Trans. Inf. Theory 54(8), 3611\u20133630 (2008).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-018-0577-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0577-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-018-0577-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:56:19Z","timestamp":1775289379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-018-0577-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["577"],"URL":"https:\/\/doi.org\/10.1007\/s10623-018-0577-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]},"assertion":[{"value":"2 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}