{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T03:26:53Z","timestamp":1769484413401,"version":"3.49.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Deutsches Zentrum f\u00fcr Luft- und Raumfahrt e.V. (DLR)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Information set decoding (ISD) algorithms currently offer the most powerful tool to solve the two archetypal problems of coding theory, namely the codeword finding problem and the syndrome decoding problem. Traditionally, ISD have primarily been studied for linear codes over finite fields, equipped with the Hamming metric. However, recently, other possibilities have also been explored. These algorithms have been adapted to different ambient spaces and metrics, such as the rank metric or the Lee metric over\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathbb {Z}_m$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msub>\n                            <mml:mi>Z<\/mml:mi>\n                            <mml:mi>m<\/mml:mi>\n                          <\/mml:msub>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . In this paper, we propose a general framework for decoding ring-linear codes that exploits the underlying ring structure to improve traditional approaches. The core idea is to project the decoding instance onto a smaller alphabet, which may enable more efficient decoding algorithms. The framework applies to coordinate-additive metric including Hamming and Lee, and extends to the rank metric, though its effectiveness strongly depends on the chosen metric. We illustrate how this framework can be leveraged to design decoding algorithms for the two aforementioned problems in Hamming, rank, and Lee metrics, along with their range of effectiveness. For each case, we provide the average computational complexity of the resulting algorithms.\n                  <\/jats:p>","DOI":"10.1007\/s10623-025-01744-3","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T07:17:37Z","timestamp":1766560657000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Information set decoding for ring-linear codes"],"prefix":"10.1007","volume":"94","author":[{"given":"Giulia","family":"Cavicchioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessio","family":"Meneghetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Tognolini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,24]]},"reference":[{"key":"1744_CR1","doi-asserted-by":"crossref","unstructured":"Abspoel M., Cramer R., Damg\u00e5rd I., Escudero D., Rambaud M., Xing C., Yuan C.: Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over $${\\mathbb{Z}}\/p^k {\\mathbb{Z}}$$. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 151\u2013180. Springer, New York (2020).","DOI":"10.1007\/978-3-030-64840-4_6"},{"key":"1744_CR2","doi-asserted-by":"crossref","unstructured":"Aragon N., Gaborit P., Hauteville A., Tillich J.-P.: A new algorithm for solving the rank syndrome decoding problem. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 2421\u20132425. IEEE (2018).","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1744_CR3","doi-asserted-by":"crossref","unstructured":"Astola H., Tabus I.: Bounds on the size of Lee-codes. In: 2013 8th International Symposium on Image and Signal Processing and Analysis (ISPA), pp. 471\u2013476. IEEE (2013).","DOI":"10.1109\/ISPA.2013.6703787"},{"issue":"4","key":"1744_CR4","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1109\/18.923743","volume":"47","author":"NS Babu","year":"2001","unstructured":"Babu N.S., Zimmermann K.-H.: Decoding of linear codes over Galois rings. IEEE Trans. Inf. Theory 47(4), 1599\u20131603 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1744_CR5","first-page":"209","volume":"30","author":"S Barg","year":"1994","unstructured":"Barg S.: Some new NP-complete coding problems. Probl. Inf. Transm. 30(3), 209\u2013214 (1994).","journal-title":"Probl. Inf. Transm."},{"key":"1744_CR6","unstructured":"Barg A.: Complexity issues in coding theory. In: Handbook of Coding Theory, vol. 1, pp. 649\u2013754 (1998)."},{"issue":"9","key":"1744_CR7","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TIT.2002.800480","volume":"48","author":"A Barg","year":"2002","unstructured":"Barg A., Forney G.D.: Random codes: minimum distances and error exponents. IEEE Trans. Inf. Theory 48(9), 2568\u20132573 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR8","unstructured":"Bariffi J., Bartz H., Liva G., Rosenthal J.: On the properties of error patterns in the constant Lee weight channel. arXiv preprint arXiv:2110.01878 (2021)."},{"key":"1744_CR9","doi-asserted-by":"crossref","unstructured":"Bariffi J., Khathuria K., Weger V.: Information set decoding for Lee-metric codes using restricted balls. In: Code-Based Cryptography Workshop, pp. 110\u2013136. Springer, New York (2022).","DOI":"10.1007\/978-3-031-29689-5_7"},{"issue":"11","key":"1744_CR10","doi-asserted-by":"publisher","first-page":"7820","DOI":"10.1109\/TIT.2024.3436938","volume":"70","author":"J Bariffi","year":"2024","unstructured":"Bariffi J., Bartz H., Liva G., Rosenthal J.: Error-correction performance of regular ring-linear LDPC codes over Lee channels. IEEE Trans. Inf. Theory 70(11), 7820\u20137839 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR11","doi-asserted-by":"crossref","unstructured":"Becker A., Joux A., May A., Meurer A.: Decoding random binary linear codes in $$2^{n\/20}$$: How $$1+ 1= 0$$ improves information set decoding. In: Advances in Cryptology\u2013EUROCRYPT 2012: 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15\u201319, 2012. Proceedings 31, pp. 520\u2013536. Springer, New York (2012).","DOI":"10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"1744_CR12","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp E., McEliece R., Van Tilborg H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR13","doi-asserted-by":"crossref","unstructured":"Bombar M., Bui D., Couteau G., Couvreur A., Ducros C., Servan-Schreiber S.: FOLEAGE: $${\\mathbb{F}}_4 $$ OLE-based multi-party computation for Boolean Circuits. Cryptology ePrint Archive (2024).","DOI":"10.1007\/978-981-96-0938-3_3"},{"issue":"3","key":"1744_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/18.986002","volume":"48","author":"E Byrne","year":"2002","unstructured":"Byrne E., Fitzpatrick P.: Hamming metric decoding of alternant codes over Galois rings. IEEE Trans. Inf. Theory 48(3), 683\u2013694 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2022.06.013","volume":"651","author":"E Byrne","year":"2022","unstructured":"Byrne E., Horlemann A.-L., Khathuria K., Weger V.: Density of free modules over finite chain rings. Linear Algebra Appl. 651, 1\u201325 (2022).","journal-title":"Linear Algebra Appl."},{"key":"1744_CR16","doi-asserted-by":"crossref","unstructured":"Canto-Torres R., Tillich J.-P.: Speeding up decoding a code with a non-trivial automorphism group up to an exponential factor. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 1927\u20131931. IEEE (2019).","DOI":"10.1109\/ISIT.2019.8849628"},{"key":"1744_CR17","unstructured":"Casta\u00f1eda \u00c1.L.M., Decastro-Garc\u00eda N., Carriegos M.V.: Decoding convolutional codes over finite rings. A linear dynamical systems approach. arXiv preprint arXiv:2411.18316 (2024)."},{"key":"1744_CR18","doi-asserted-by":"crossref","unstructured":"Chabaud F., Stern J.: The cryptographic security of the syndrome decoding problem for rank distance codes. In: Advances in Cryptology-ASIACRYPT\u201996: International Conference on the Theory and Applications of Cryptology and Information Security Kyongju, Korea, November 3\u20137, 1996 Proceedings, pp. 368\u2013381. Springer, New York (1996).","DOI":"10.1007\/BFb0034862"},{"key":"1744_CR19","doi-asserted-by":"crossref","unstructured":"Chailloux A., Debris-Alazard T., Etinski S.: Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric. In: Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20\u201322, 2021, Proceedings 12, pp. 44\u201362. Springer, New York (2021).","DOI":"10.1007\/978-3-030-81293-5_3"},{"key":"1744_CR20","doi-asserted-by":"crossref","unstructured":"Cramer R., Rambaud M., Xing C.: Asymptotically-good arithmetic secret sharing over $$ {\\mathbb{Z}} \/p^\\ell {\\mathbb{Z}}$$ with strong multiplication and its applications to efficient MPC. In: Advances in Cryptology\u2013CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part III 41, pp. 656\u2013686. Springer, New York (2021).","DOI":"10.1007\/978-3-030-84252-9_22"},{"issue":"3","key":"1744_CR21","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1744_CR22","doi-asserted-by":"crossref","unstructured":"Ducas L., Esser A., Etinski S., Kirshanova E.: Asymptotics and improvements of sieving for codes. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 151\u2013180. Springer, New York (2024).","DOI":"10.1007\/978-3-031-58754-2_6"},{"key":"1744_CR23","doi-asserted-by":"crossref","unstructured":"Escudero D., Hong C., Liu H., Xing C., Yuan C.: Degree-$$d$$ reverse multiplication-friendly embeddings: constructions and applications. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 106\u2013138. Springer, New York (2023).","DOI":"10.1007\/978-981-99-8721-4_4"},{"issue":"1","key":"1744_CR24","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/TIT.2015.2493539","volume":"62","author":"J-C Faug\u00e8re","year":"2015","unstructured":"Faug\u00e8re J.-C., Otmani A., Perret L., de Portzamparc F., Tillich J.-P.: Folding alternant and Goppa codes with non-trivial automorphism groups. IEEE Trans. Inf. Theory 62(1), 184\u2013198 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1744_CR25","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985).","journal-title":"Problemy Peredachi Informatsii"},{"issue":"12","key":"1744_CR26","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P., Z\u00e9mor G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inf. Theory 62(12), 7245\u20137252 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1744_CR27","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2015","unstructured":"Gaborit P., Ruatta O., Schrek J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR28","doi-asserted-by":"crossref","unstructured":"Gardy D., Sol\u00e9 P.: Saddle point techniques in asymptotic coding theory. In:Workshop on Algebraic Coding, pp. 75\u201381. Springer, New York (1991).","DOI":"10.1007\/BFb0034343"},{"key":"1744_CR29","doi-asserted-by":"crossref","unstructured":"Gentry C.: Key recovery and message attacks on NTRU-composite. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 182\u2013194. Springer, New York (2001).","DOI":"10.1007\/3-540-44987-6_12"},{"issue":"16","key":"1744_CR30","doi-asserted-by":"publisher","first-page":"1878","DOI":"10.3390\/math9161878","volume":"9","author":"J G\u00f3mez-Torrecillas","year":"2021","unstructured":"G\u00f3mez-Torrecillas J., Lobillo F., Navarro G.: Decoding linear codes over chain rings given by parity check matrices. Mathematics 9(16), 1878 (2021).","journal-title":"Mathematics"},{"issue":"3","key":"1744_CR31","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/18.669412","volume":"44","author":"M Greferath","year":"1998","unstructured":"Greferath M., Vellbinger U.: Efficient decoding of $${\\mathbb{Z} }_{p^k}$$-linear codes. IEEE Trans. Inf. Theory 44(3), 1288\u20131291 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR32","doi-asserted-by":"crossref","unstructured":"Guo Q., Johansson T., Nguyen V.: A new sieving-style information-set decoding algorithm. IEEE Trans. Inf. Theory (2024).","DOI":"10.1109\/TIT.2024.3457150"},{"issue":"2","key":"1744_CR33","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950).","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"1744_CR34","doi-asserted-by":"publisher","first-page":"677","DOI":"10.3934\/amc.2020089","volume":"15","author":"A-L Horlemann-Trautmann","year":"2020","unstructured":"Horlemann-Trautmann A.-L., Weger V.: Information set decoding in the Lee metric with applications to cryptography. Adv. Math. Commun. 15(4), 677\u2013699 (2020).","journal-title":"Adv. Math. Commun."},{"key":"1744_CR35","doi-asserted-by":"crossref","unstructured":"H\u00f6rmann F., van\u00a0Woerden W.: FuLeakage: breaking Fuleeca by learning attacks. In: Annual International Cryptology Conference, pp. 253\u2013286. Springer, New York (2024).","DOI":"10.1007\/978-3-031-68391-6_8"},{"issue":"3","key":"1744_CR36","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/18.568713","volume":"43","author":"JC Interlando","year":"1997","unstructured":"Interlando J.C., Palazzo R., Elia M.: On the decoding of Reed-Solomon and BCH codes over integer residue rings. IEEE Trans. Inf. Theory 43(3), 1013\u20131021 (1997).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1744_CR37","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.3934\/amc.2023003","volume":"18","author":"HT Kalachi","year":"2024","unstructured":"Kalachi H.T., Kamche H.T.: On the rank decoding problem over finite principal ideal rings. Adv. Math. Commun. 18(5), 1492\u20131513 (2024).","journal-title":"Adv. Math. Commun."},{"key":"1744_CR38","doi-asserted-by":"crossref","unstructured":"Kamche H.T., Kalachi H.T.: On the generalizations of the rank metric over finite chain rings. In: International Conference on Cryptology in Africa, pp. 201\u2013221. Springer, New York (2024).","DOI":"10.1007\/978-3-031-64381-1_9"},{"issue":"12","key":"1744_CR39","doi-asserted-by":"publisher","first-page":"7718","DOI":"10.1109\/TIT.2019.2933520","volume":"65","author":"HT Kamche","year":"2019","unstructured":"Kamche H.T., Mouaha C.: Rank-metric codes over finite principal ideal rings and applications. IEEE Trans. Inf. Theory 65(12), 7718\u20137735 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR40","doi-asserted-by":"crossref","unstructured":"Kirshanova E., Laarhoven T.: Lower bounds on lattice sieving and information set decoding. In: Advances in Cryptology\u2013CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part II 41, pp. 791\u2013820. Springer, New York (2021).","DOI":"10.1007\/978-3-030-84245-1_27"},{"issue":"2","key":"1744_CR41","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/TIT.1958.1057446","volume":"4","author":"C Lee","year":"1958","unstructured":"Lee C.: Some properties of nonbinary error-correcting codes. IRE Trans. Inf. Theory 4(2), 77\u201382 (1958).","journal-title":"IRE Trans. Inf. Theory"},{"key":"1744_CR42","doi-asserted-by":"crossref","unstructured":"Lee P.J., Brickell E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Advances in Cryptology-EUROCRYPT\u201988: Workshop on the Theory and Application of Cryptographic Techniques Davos, Switzerland, May 25\u201327, 1988 Proceedings 7, pp. 275\u2013280. Springer, New York (1988).","DOI":"10.1007\/3-540-45961-8_25"},{"key":"1744_CR43","doi-asserted-by":"crossref","unstructured":"Liu H., Wang X., Yang K., Yu Y.: The hardness of LPN over any integer ring and field for PCG applications. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 149\u2013179. Springer, New York (2024).","DOI":"10.1007\/978-3-031-58751-1_6"},{"issue":"6","key":"1744_CR44","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1109\/18.340483","volume":"40","author":"H-A Loeliger","year":"1994","unstructured":"Loeliger H.-A.: An upper bound on the volume of discrete spheres. IEEE Trans. Inf. Theory 40(6), 2071\u20132073 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR45","unstructured":"Loidreau P.: Properties of codes in rank metric. arXiv preprint cs\/0610057 (2006)."},{"key":"1744_CR46","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10623-012-9716-0","volume":"71","author":"P Loidreau","year":"2014","unstructured":"Loidreau P.: Asymptotic behaviour of codes in rank metric over finite fields. Des. Codes Cryptogr. 71, 105\u2013118 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"1744_CR47","volume-title":"Finite Rings with Identity","author":"BR McDonald","year":"1974","unstructured":"McDonald B.R.: Finite Rings with Identity, vol. 28. Marcel Dekker Incorporated, New York (1974)."},{"key":"1744_CR48","first-page":"114","volume":"4244","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic. Coding Thv 4244, 114\u2013116 (1978).","journal-title":"Coding Thv"},{"key":"1744_CR49","unstructured":"Melchor C.A., Aragon N., Bardet M., Bettaieb S., Bidoux L., Blazy O., Deneuville J.-C., Gaborit P., Hauteville A., Otmani A., et\u00a0al.: Rollo-rank-Ouroboros, Lake & Locker. Round-2 submission to the NIST PQC project (2019)."},{"issue":"2","key":"1744_CR50","first-page":"157","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Prob. Contr. Inf. Theory 15(2), 157\u2013166 (1986).","journal-title":"Prob. Contr. Inf. Theory"},{"issue":"7","key":"1744_CR51","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/PL00012382","volume":"10","author":"G Norton","year":"2000","unstructured":"Norton G., S\u0103l\u0103gean A.: On the structure of linear and cyclic codes over a finite chain ring. Appl. Algebra Eng. Commun. Comput. 10(7), 489\u2013506 (2000).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"1744_CR52","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1109\/18.841186","volume":"46","author":"GH Norton","year":"2000","unstructured":"Norton G.H., Salagean A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46(3), 1060\u20131067 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1744_CR53","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1020369320078","volume":"38","author":"AV Ourivski","year":"2002","unstructured":"Ourivski A.V., Johansson T.: New technique for decoding codes in the rank metric and its cryptography applications. Probl. Inf. Transm. 38, 237\u2013246 (2002).","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"1744_CR54","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3934\/amc.2007.1.99","volume":"1","author":"F Ozbudak","year":"2007","unstructured":"Ozbudak F., Sol\u00e9 P.: Gilbert-Varshamov type bounds for linear codes over finite chain rings. Adv. Math. Commun. 1(1), 99\u2013109 (2007).","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"1744_CR55","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10623-008-9220-8","volume":"50","author":"YH Park","year":"2009","unstructured":"Park Y.H.: Modular independence and generator matrices for codes over. Des. Codes Cryptogr. 50(2), 147\u2013162 (2009).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1744_CR56","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TIT.1967.1054053","volume":"13","author":"J Pierce","year":"1967","unstructured":"Pierce J.: Limit distribution of the minimum distance of random linear codes. IEEE Trans. Inf. Theory 13(4), 595\u2013599 (1967).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1744_CR57","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962).","journal-title":"IRE Trans. Inf. Theory"},{"key":"1744_CR58","doi-asserted-by":"crossref","unstructured":"Puchinger S., Renner J., Wachter-Zeh A., Zumbr\u00e4gel J.: Efficient decoding of Gabidulin codes over Galois rings. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 25\u201330. IEEE (2021).","DOI":"10.1109\/ISIT45174.2021.9517904"},{"issue":"6","key":"1744_CR59","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1080\/00207219308907181","volume":"75","author":"BS Rajan","year":"1993","unstructured":"Rajan B.S., Siddiqi M.: Transform decoding of BCH codes over $${\\mathbb{Z} }_m$$. Int. J. Electron. Theor. Exp. 75(6), 1043\u20131054 (1993).","journal-title":"Int. J. Electron. Theor. Exp."},{"key":"1744_CR60","doi-asserted-by":"crossref","unstructured":"Renner J., Puchinger S., Wachter-Zeh A., Hollanti C., Freij-Hollanti R.: Low-rank parity-check codes over the ring of integers modulo a prime power. In: 2020 IEEE International Symposium on Information Theory (ISIT), pp. 19\u201324. IEEE (2020).","DOI":"10.1109\/ISIT44484.2020.9174384"},{"issue":"2","key":"1744_CR61","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10623-020-00825-9","volume":"89","author":"J Renner","year":"2021","unstructured":"Renner J., Neri A., Puchinger S.: Low-rank parity-check codes over Galois rings. Des. Codes Cryptogr. 89(2), 351\u2013386 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1744_CR62","doi-asserted-by":"crossref","unstructured":"Ritterhoff S., Maringer G., Bitzer S., Weger V., Karl P., Schamberger T., Schupp J., Wachter-Zeh A.: FuLeeca: a Lee-based signature scheme. In: Code-Based Cryptography Workshop, pp. 56\u201383. Springer, New York (2023).","DOI":"10.1007\/978-3-031-46495-9_4"},{"key":"1744_CR63","doi-asserted-by":"crossref","unstructured":"Rosenthal J.: An algebraic decoding algorithm for convolutional codes. In: Dynamical Systems, Control, Coding, Computer Vision: New Trends, Interfaces, and Interplay, pp. 343\u2013360. Springer, New York (1999).","DOI":"10.1007\/978-3-0348-8970-4_16"},{"issue":"18\u201319","key":"1744_CR64","first-page":"4","volume":"47","author":"RM Roth","year":"2006","unstructured":"Roth R.M.: Introduction to coding theory. IET Commun. 47(18\u201319), 4 (2006).","journal-title":"IET Commun."},{"key":"1744_CR65","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume":"388","author":"J Stern","year":"1989","unstructured":"Stern J.: A method for finding codewords of small weight. Coding Theory Appl. 388, 106\u2013113 (1989).","journal-title":"Coding Theory Appl."},{"issue":"1","key":"1744_CR66","doi-asserted-by":"publisher","first-page":"233","DOI":"10.3934\/amc.2022029","volume":"18","author":"V Weger","year":"2024","unstructured":"Weger V., Khathuria K., Horlemann A.-L., Battaglioni M., Santini P., Persichetti E.: On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. 18(1), 233\u2013266 (2024).","journal-title":"Adv. Math. Commun."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01744-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01744-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01744-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T17:13:11Z","timestamp":1769447591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01744-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,24]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["1744"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01744-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,24]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"16"}}