{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:16:46Z","timestamp":1767626206216,"version":"3.38.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s40314-024-03057-y","type":"journal-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:33:13Z","timestamp":1735587193000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The impact of alternant codes over Eisenstein integers on modern technology"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0006-1156","authenticated-orcid":false,"given":"Muhammad","family":"Sajjad","sequence":"first","affiliation":[]},{"given":"Tariq","family":"Shah","sequence":"additional","affiliation":[]},{"given":"Muhammad","family":"Abbas","sequence":"additional","affiliation":[]},{"given":"Maha","family":"Alammari","sequence":"additional","affiliation":[]},{"given":"Robinson-Julian","family":"Serna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,30]]},"reference":[{"issue":"22","key":"3057_CR1","first-page":"1075","volume":"5","author":"O Alkam","year":"2010","unstructured":"Alkam O, Osba EA (2010) On Eisenstein integers modulo(n). Int Math Forum 5(22):1075\u20131082","journal-title":"Int Math Forum"},{"key":"3057_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1590\/S0101-82052003000200005","volume":"22","author":"AA Andrade","year":"2003","unstructured":"Andrade AA, Interlando JC, Palazzo R Jr (2003) Alternant and BCH codes over certain rings. Comput Appl Math 22:233\u2013247","journal-title":"Comput Appl Math"},{"issue":"8","key":"3057_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1109\/TVLSI.2006.878484","volume":"14","author":"JH Baek","year":"2006","unstructured":"Baek JH, Sunwoo MH (2006) New degree computationless modified euclid algorithm and architecture for Reed-Solomon decoder. IEEE Trans Very Large Scale Integr VLSI Syst 14(8):915\u2013920","journal-title":"IEEE Trans Very Large Scale Integr VLSI Syst"},{"key":"3057_CR4","doi-asserted-by":"crossref","unstructured":"Bardet M, Mora R, Tillich JP (2023) Polynomial time key-recovery attack on high rate random alternant codes. IEEE Trans Inf Theory","DOI":"10.1109\/TIT.2023.3334592"},{"issue":"4","key":"3057_CR5","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/S0019-9958(72)90223-9","volume":"20","author":"IF Blake","year":"1972","unstructured":"Blake IF (1972) Codes over certain rings. Inf Control 20(4):396\u2013404","journal-title":"Inf Control"},{"issue":"31","key":"3057_CR6","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.12988\/imf.2014.111121","volume":"9","author":"V Bu\u00e7aj","year":"2014","unstructured":"Bu\u00e7aj V (2014) Finding factors of factor rings over the Eisenstein integers. Int Math Forum 9(31):1521\u20131537","journal-title":"Int Math Forum"},{"issue":"3","key":"3057_CR7","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/18.986002","volume":"48","author":"E Byrne","year":"2002","unstructured":"Byrne E, Fitzpatrick P (2002) Hamming metric decoding of alternant codes over Galois rings. IEEE Trans Inf Theory 48(3):683\u2013694","journal-title":"IEEE Trans Inf Theory"},{"issue":"1\u20133","key":"3057_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0024-3795(98)10163-5","volume":"286","author":"AA De Andrade","year":"1999","unstructured":"De Andrade AA, Palazzo R Jr (1999) Construction and decoding of BCH codes over finite commutative rings. Linear Algebra Appl 286(1\u20133):69\u201385","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"3057_CR9","first-page":"207","volume":"6","author":"AA De Andrade","year":"2005","unstructured":"De Andrade AA, Palazzo R Jr (2005) Linear codes over finite rings. Trends Comput Appl Math 6(2):207\u2013217","journal-title":"Trends Comput Appl Math"},{"key":"3057_CR10","unstructured":"De Andrade AA, Shah T, Khan A (2010) Decoding procedure for BCH, alternant and Goppa codes defined over semigroup ring."},{"issue":"2","key":"3057_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.5540\/tema.2011.012.02.0079","volume":"12","author":"AA De Andrade","year":"2011","unstructured":"De Andrade AA, Shah T, Khan A (2011) A note on linear codes over semigroup rings. Trends Comput Appl Math 12(2):79\u201389","journal-title":"Trends Comput Appl Math"},{"key":"3057_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s002000050103","volume":"9","author":"P Fitzpatrick","year":"1998","unstructured":"Fitzpatrick P, Jennings SM (1998) Comparison of two algorithms for decoding alternant codes. Appl Algebra Eng Commun Comput 9:211\u2013220","journal-title":"Appl Algebra Eng Commun Comput"},{"issue":"12","key":"3057_CR13","doi-asserted-by":"publisher","first-page":"8016","DOI":"10.1109\/TIT.2021.3115432","volume":"67","author":"L Holzbaur","year":"2021","unstructured":"Holzbaur L, Liu H, Neri A, Puchinger S, Rosenkilde J, Sidorenko V, Wachter-Zeh A (2021) Decoding of interleaved alternant codes. IEEE Trans Inf Theory 67(12):8016\u20138033","journal-title":"IEEE Trans Inf Theory"},{"key":"3057_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1090\/conm\/168\/01696","volume":"168","author":"K Huber","year":"1994","unstructured":"Huber K (1994) Codes over eisenstein-jacobi integers. Contemp Math 168:165\u2013165","journal-title":"Contemp Math"},{"key":"3057_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ffa.2018.09.005","volume":"55","author":"Y Liu","year":"2019","unstructured":"Liu Y, Li R, Fu Q, Lu L, Rao Y (2019) Some binary BCH codes with length n= 2m+ 1. Finite Fields Appl 55:109\u2013133","journal-title":"Finite Fields Appl"},{"key":"3057_CR16","volume-title":"The theory of error correcting codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams FJ, Sloane NJA (1977) The theory of error correcting codes, vol 16. Elsevier"},{"key":"3057_CR17","unstructured":"McDonald BR (1974) Finite rings with identity, ser. Monographs and textbooks in pure and applied mathematics. Marcel Dekker, Inc, 28"},{"issue":"1","key":"3057_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2023.102338","volume":"15","author":"T Ramachandran","year":"2024","unstructured":"Ramachandran T, Faruque MRI (2024) Polarization dependent 1-bit coding metamaterial for radar cross section reduction in microwave frequency applications. Ain Shams Eng J 15(1):102338","journal-title":"Ain Shams Eng J"},{"issue":"12","key":"3057_CR19","doi-asserted-by":"publisher","first-page":"29453","DOI":"10.3934\/math.20231508","volume":"8","author":"M Sajjad","year":"2023","unstructured":"Sajjad M, Shah T, Xin Q, Almutairi B (2023a) Eisenstein field BCH codes construction and decoding. AIMS Math 8(12):29453\u201329473","journal-title":"AIMS Math"},{"key":"3057_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3293007","author":"M Sajjad","year":"2023","unstructured":"Sajjad M, Shah T, Alammari M, Alsaud H (2023b) Construction and decoding of BCH-codes over the Gaussian field. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2023.3293007","journal-title":"IEEE Access"},{"issue":"3","key":"3057_CR21","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.asej.2018.11.007","volume":"10","author":"NF Saudy","year":"2019","unstructured":"Saudy NF, Ali IA, Al Barkouky R (2019) Error analysis and detection procedures for elliptic curve cryptography. Ain Shams Eng J 10(3):587\u2013597","journal-title":"Ain Shams Eng J"},{"issue":"2","key":"3057_CR22","doi-asserted-by":"publisher","first-page":"419","DOI":"10.4134\/BKMS.2006.43.2.419","volume":"43","author":"T Shah","year":"2006","unstructured":"Shah T (2006) A note on ascend and descend of factorization properties. Bull-Kor Math Soc 43(2):419","journal-title":"Bull-Kor Math Soc"},{"issue":"4","key":"3057_CR23","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1016\/j.camwa.2011.05.056","volume":"62","author":"T Shah","year":"2011","unstructured":"Shah T, Khan A, de Andrade AA (2011) Constructions of codes through the semigroup ring B [X; 122Z0] and encoding. Comput Math Appl 62(4):1645\u20131654","journal-title":"Comput Math Appl"},{"issue":"4","key":"3057_CR24","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/TIT.1979.1056063","volume":"25","author":"P Shankar","year":"1979","unstructured":"Shankar P (1979) On BCH codes over arbitrary integer tings (Corresp). IEEE Trans Inf Theory 25(4):480\u2013483","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"3057_CR25","doi-asserted-by":"publisher","first-page":"102924","DOI":"10.1016\/j.asej.2024.102924","volume":"15","author":"K Zhang","year":"2024","unstructured":"Zhang K, Dai J, Yu X, Zhang G (2024) Distance correction range-free localization algorithm for WSNs. Ain Shams Eng J 15(9):102924","journal-title":"Ain Shams Eng J"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03057-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03057-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03057-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T07:59:24Z","timestamp":1741420764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03057-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,30]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["3057"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03057-y","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,12,30]]},"assertion":[{"value":"18 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"95"}}