{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T04:13:18Z","timestamp":1742271198289,"version":"3.40.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10623-024-01536-1","type":"journal-article","created":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T17:19:02Z","timestamp":1733332742000},"page":"615-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Derivative descendants of cyclic codes and constacyclic codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Li","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiling","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengchun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,4]]},"reference":[{"key":"1536_CR1","unstructured":"Assmus Jr., E.F., Key, J.D.: Polynomial codes and finite geometries. In: V.S. Pless and W.C. Huffman (eds.), Handbook of Coding Theory, vol. II, pp. 1269\u20131343. Elsevier, Amsterdam (1998)."},{"key":"1536_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800467","volume-title":"Algebraic Codes for Data Transmission","author":"RE Blahut","year":"2003","unstructured":"Blahut R.E.: Algebraic Codes for Data Transmission. Cambridge University Press, Cambridge (2003)."},{"key":"1536_CR3","doi-asserted-by":"crossref","unstructured":"Berlekamp E.R.: Algebraic Coding Theory, revised World Scientific (2015).","DOI":"10.1142\/9407"},{"issue":"11","key":"1536_CR4","doi-asserted-by":"publisher","first-page":"7107","DOI":"10.1109\/TIT.2022.3184168","volume":"68","author":"M Bossert","year":"2022","unstructured":"Bossert M., Schulz R., Bitzer S.: On hard and soft decision decoding of BCH codes. IEEE Trans. Inf. Theor. 68(11), 7107\u20137124 (2022).","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1536_CR5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/TIT.1970.1054554","volume":"16","author":"P Delsarte","year":"1970","unstructured":"Delsarte P., Goethals J.M.: On generalized Reed-Muller codes and their relatives. IEEE Trans. Inf. Theor. 16, 403\u2013442 (1970).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5","key":"1536_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TIT.1975.1055435","volume":"21","author":"P Delsarte","year":"1975","unstructured":"Delsarte P.: On subfield subcodes of modified Reed-Solomon codes (Corresp.). IEEE Trans. Inf. Theor. 21(5), 575\u2013576 (1975).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"7","key":"1536_CR7","doi-asserted-by":"publisher","first-page":"3605","DOI":"10.1109\/TIT.2010.2048504","volume":"56","author":"C Ding","year":"2010","unstructured":"Ding C., Yang Y., Tang X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theor. 56(7), 3605\u20133612 (2010).","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1536_CR8","first-page":"129","volume":"33","author":"X Dong","year":"2010","unstructured":"Dong X., Yin S.: The trace representation of $$\\lambda $$-constacyclic codes over $$\\mathbb{F} _q$$. J. Liaoning Normal Univ. (Nat. Sci. ed.) 33, 129\u2013131 (2010).","journal-title":"J. Liaoning Normal Univ. (Nat. Sci. ed.)"},{"issue":"3","key":"1536_CR9","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/TIT.2005.864443","volume":"52","author":"I Dumer","year":"2006","unstructured":"Dumer I., Shabunov K.: Soft-decision decoding of Reed-Muller codes: recursive lists. IEEE Trans. Inf. Theor. 52(3), 1260\u20131266 (2006).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"4","key":"1536_CR10","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1137\/0109055","volume":"9","author":"HF Mattson","year":"1961","unstructured":"Mattson H.F., Solomon G.: A new treatment of Bose-Chaudhuri codes. J. Soc. Ind. Appl. Math. 9(4), 654\u2013669 (1961).","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"6","key":"1536_CR11","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1109\/49.29620","volume":"7","author":"Farhad Hemmati","year":"1989","unstructured":"Hemmati Farhad: Closest coset decoding of $$|u|u + v|$$ codes. IEEE J. Sel. Areas Commun. 7(6), 982\u2013988 (1989).","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"1536_CR12","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1109\/TIT.2024.3362323","volume":"70","author":"Q Huang","year":"2024","unstructured":"Huang Q., Zhang B.: Derivative descendants of cyclic codes and derivative decoding. IEEE Trans. Inf. Theor. 70(4), 2395\u20132410 (2024).","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1536_CR13","doi-asserted-by":"crossref","unstructured":"Lian, M., H\u00e4ger, C., Pfister, H.D.: Decoding Reed-Muller codes using redundant code constraints. In: 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, pp. 42\u201347 (2020).","DOI":"10.1109\/ISIT44484.2020.9174087"},{"key":"1536_CR14","unstructured":"Lin, S., Costello, D.J.: Error Control Coding. Prentice Hall, New York, 2(4) (2001)."},{"issue":"9","key":"1536_CR15","doi-asserted-by":"publisher","first-page":"5358","DOI":"10.1109\/TIT.2020.2978383","volume":"66","author":"S Lin","year":"2020","unstructured":"Lin S., Abdel-Ghaffar K., Li J., Liu K.: A scheme for collective encoding and iterative soft-decision decoding of cyclic codes of prime lengths. Applications to Reed-Solomon. BCH Quadratic Residue Codes IEEE Trans. Inf. Theor. 66(9), 5358\u20135378 (2020).","journal-title":"BCH Quadratic Residue Codes IEEE Trans. Inf. Theor."},{"key":"1536_CR16","volume-title":"The Theory of Error-correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-correcting Codes, vol. 16. Elsevier, Amsterdam (1977)."},{"key":"1536_CR17","unstructured":"Kabatyansky G.A.: On decoding Reed-Muller codes in semicontinuous channel. In: Proceeding Second International Workshop Algebraic and Combinatorial Coding Theory, Leningrad, USSR, pp. 87\u201391 (1990)."},{"issue":"1","key":"1536_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/18.904511","volume":"47","author":"N Kamiya","year":"2001","unstructured":"Kamiya N.: On algebraic soft-decision decoding algorithms for BCH codes. IEEE Trans. Inf. Theor. 47(1), 45\u201358 (2001).","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1536_CR19","unstructured":"Kasami T.: Weight distributions of Bose-Chaudhuri-Hocquenghem codes, Coordinated Science Laboratory, Urbana, Tech Rep R-317 (1966)."},{"issue":"5","key":"1536_CR20","first-page":"475","volume":"11","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.: Some results on cyclic codes which are invariant under the affine group and their applications. Inf. Control 11(5), 475\u2013496 (1968).","journal-title":"Inf. Control"},{"issue":"2","key":"1536_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.: New generalizations of the Reed-Muller codes-I: primitive codes. IEEE Trans. Inf. Theor. 14(2), 189\u2013199 (1968).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"6","key":"1536_CR22","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TIT.1968.1054226","volume":"14","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.: Polynomial codes. IEEE Trans. Inf. Theor. 14(6), 807\u2013814 (1968).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"7","key":"1536_CR23","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y Kou","year":"2001","unstructured":"Kou Y., Lin S., Fossorier M.P.: Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. Theor. 47(7), 2711\u20132736 (2001).","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1536_CR24","volume-title":"Error-correcting Codes","author":"WW Peterson","year":"1961","unstructured":"Peterson W.W.: Error-correcting Codes. MIT Press, Cambridge (1961)."},{"issue":"7","key":"1536_CR25","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1109\/26.297835","volume":"42","author":"R Pellizzoni","year":"1994","unstructured":"Pellizzoni R., Spalvieri A.: Binary multilevel coset codes based on Reed-Muller codes. IEEE Trans. Commun. 42(7), 2357\u20132360 (1994).","journal-title":"IEEE Trans. Commun."},{"key":"1536_CR26","unstructured":"Pless Vera., Richard A.: Handbook of Coding Theory. Elsevier Science Inc, Brualdi and William Cary Huffman (1998)."},{"issue":"4","key":"1536_CR27","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","volume":"6","author":"M Plotkin","year":"1960","unstructured":"Plotkin M.: Binary codes with specified minimum distance. IRE Trans. Inf. Theor. 6(4), 445\u2013450 (1960).","journal-title":"IRE Trans. Inf. Theor."},{"key":"1536_CR28","unstructured":"Prange E.: Cyclic Error-correcting Codes in Two Symbols. Air force Cambridge research center (1957)."},{"key":"1536_CR29","unstructured":"Prange E.: An algorithm for factoring $$x^n-1$$ over a finite field, TN-59-175 (1959)."},{"key":"1536_CR30","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1109\/18.370093","volume":"41","author":"G Schnabl","year":"1995","unstructured":"Schnabl G., Bossert M.: Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes. IEEE Trans. Inf. Theor. 41, 304\u2013308 (1995).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"1536_CR31","doi-asserted-by":"publisher","first-page":"123","DOI":"10.3934\/amc.2018008","volume":"12","author":"A Sharma","year":"2018","unstructured":"Sharma A., Rani S.: Trace description and Hamming weights of irreducible constacyclic codes. Adv. Math. Commun. 12(1), 123\u2013141 (2018).","journal-title":"Adv. Math. Commun."},{"issue":"3","key":"1536_CR32","first-page":"80","volume":"28","author":"VM Sidel\u2019nikov","year":"1992","unstructured":"Sidel\u2019nikov V.M., Pershakov A.: Decoding of Reed-Muller codes with a large number of errors. Probl. Peredachi Inf. 28(3), 80\u201394 (1992).","journal-title":"Probl. Peredachi Inf."},{"key":"1536_CR33","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s12095-019-00401-6","volume":"12","author":"Z Sun","year":"2020","unstructured":"Sun Z., Zhu S., Wang L.: A class of constacyclic BCH codes. Cryptogr. Commun. 12, 265\u2013284 (2020).","journal-title":"Cryptogr. Commun."},{"issue":"2","key":"1536_CR34","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TIT.2004.840867","volume":"51","author":"H Tang","year":"2005","unstructured":"Tang H., Xu J., Lin S., Abdel-Ghaffar K.A.S.: Codes on finite geometries. IEEE Trans. Inf. Theor. 51(2), 572\u2013596 (2005).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"1536_CR35","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/26.752809","volume":"47","author":"XWTL Tapp","year":"1999","unstructured":"Tapp X.W.T.L., Luna A.A., Wicker S.B.: Extended Hamming and BCH soft decision decoders for mobile data applications. IEEE Trans. Commun. 47(3), 333\u2013337 (1999).","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"1536_CR36","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1109\/18.915675","volume":"47","author":"A Thangaraj","year":"2001","unstructured":"Thangaraj A., McLaughlin S.: Quantum codes from cyclic codes over GF$$(4m)$$. IEEE Trans. Inf. Theor. 47(3), 1176\u20131178 (2001).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"2","key":"1536_CR37","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1109\/18.312184","volume":"40","author":"A Vardy","year":"1994","unstructured":"Vardy A., Be\u2019ery Y.: Maximum-likelihood soft decision decoding of BCH codes. IEEE Trans. Inf. Theor. 40(2), 546\u2013554 (1994).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"8","key":"1536_CR38","doi-asserted-by":"publisher","first-page":"4948","DOI":"10.1109\/TIT.2020.2977917","volume":"66","author":"M Ye","year":"2020","unstructured":"Ye M., Abbe E.: Recursive projection-aggregation decoding of Reed-Muller codes. IEEE Trans. Inf. Theor. 66(8), 4948\u20134965 (2020).","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"1536_CR39","first-page":"5","volume":"12","author":"VA Zinoviev","year":"1976","unstructured":"Zinoviev V.A.: Generalized concatenated codes. Probl. Pederuchi Informatsii 12(1), 5\u201315 (1976).","journal-title":"Probl. Pederuchi Informatsii"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01536-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:40:40Z","timestamp":1742229640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01536-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,4]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1536"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01536-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,12,4]]},"assertion":[{"value":"3 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 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":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}