{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:52:04Z","timestamp":1776955924706,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"PAPIIT-UNAM","award":["IN107423"],"award-info":[{"award-number":["IN107423"]}]},{"name":"PAPIIT-UNAM","award":["IN107423"],"award-info":[{"award-number":["IN107423"]}]},{"name":"Consejo Nacional de Humanidades, Ciencias y Tecnolog\u00edas","award":["No. CVU: 780173"],"award-info":[{"award-number":["No. CVU: 780173"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,12]]},"abstract":"Abstract<\/jats:title>\n \n A class of optimal three-weight\n \n \n $$[q^k-1,k+1,q^{k-1}(q-1)-1]$$<\/jats:tex-math>\n \n \n [<\/mml:mo>\n \n q<\/mml:mi>\n k<\/mml:mi>\n <\/mml:msup>\n -<\/mml:mo>\n 1<\/mml:mn>\n ,<\/mml:mo>\n k<\/mml:mi>\n +<\/mml:mo>\n 1<\/mml:mn>\n ,<\/mml:mo>\n \n q<\/mml:mi>\n \n k<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n \n (<\/mml:mo>\n q<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n )<\/mml:mo>\n <\/mml:mrow>\n -<\/mml:mo>\n 1<\/mml:mn>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n cyclic codes over\n \n \n $${\\mathrm{I\\!F}}_q$$<\/jats:tex-math>\n \n \n \n I<\/mml:mi>\n \n F<\/mml:mi>\n <\/mml:mrow>\n q<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , with\n \n \n $$k\\ge 2$$<\/jats:tex-math>\n \n \n k<\/mml:mi>\n \u2265<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , achieving the Griesmer bound, was presented by Heng and Yue (IEEE Trans Inf Theory 62(8):4501\u20134513, 2016. https:\/\/doi.org\/10.1109\/TIT.2016.2550029). In this paper we study some of the subfield codes of this class of optimal cyclic codes when\n \n \n $$k=2$$<\/jats:tex-math>\n \n \n k<\/mml:mi>\n =<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . The weight distributions of the subfield codes are settled. It turns out that some of these codes are optimal and others have the best known parameters. The duals of the subfield codes are also investigated and found to be almost optimal with respect to the sphere-packing bound. In addition, the covering structure for the studied subfield codes is determined. Some of these codes are found to have the important property that any nonzero codeword is minimal, which is a desirable property that is useful in the design of a secret sharing scheme based on a linear code. Moreover, a specific example of a secret sharing scheme based on one of these subfield codes is given. Finally, a class of optimal two-weight linear codes over\n \n \n $${\\mathrm{I\\!F}}_q$$<\/jats:tex-math>\n \n \n \n I<\/mml:mi>\n \n F<\/mml:mi>\n <\/mml:mrow>\n q<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , achieving the Griesmer bound, whose duals are almost optimal with respect to the sphere-packing bound is presented. Through a different approach, this class of optimal two-weight linear codes was reported very recently by Heng (IEEE Trans Inf Theory 69(2):978\u2013994, 2023. https:\/\/doi.org\/10.1109\/TIT.2022.3203380). Furthermore, it is shown that these optimal codes can be used to construct strongly regular graphs.\n <\/jats:p>","DOI":"10.1007\/s00453-023-01173-5","type":"journal-article","created":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T05:02:25Z","timestamp":1695618145000},"page":"3973-3995","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Subfield and Extended Codes of a Subclass of Optimal Three-Weight Cyclic Codes"],"prefix":"10.1007","volume":"85","author":[{"given":"F\u00e9lix","family":"Hern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerardo","family":"Vega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,25]]},"reference":[{"key":"1173_CR1","doi-asserted-by":"publisher","unstructured":"Hern\u00e1ndez, F., Vega, G.: On the subfield codes of a subclass of optimal cyclic codes and their covering structures. In: Casta\u00f1eda, A., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATIN 2022: Theoretical Informatics, pp. 255\u2013270. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_16","DOI":"10.1007\/978-3-031-20624-5_16"},{"issue":"8","key":"1173_CR2","doi-asserted-by":"publisher","first-page":"4501","DOI":"10.1109\/TIT.2016.2550029","volume":"62","author":"Z Heng","year":"2016","unstructured":"Heng, Z., Yue, Q.: Several classes of cyclic codes with either optimal three weights or a few weights. IEEE Trans. Inf. Theory 62(8), 4501\u20134513 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2550029","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1173_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ffa.2016.07.001","volume":"42","author":"G Vega","year":"2016","unstructured":"Vega, G.: A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field. Finite Fields Their Appl. 42, 23\u201338 (2016). https:\/\/doi.org\/10.1016\/j.ffa.2016.07.001","journal-title":"Finite Fields Their Appl."},{"issue":"11","key":"1173_CR4","doi-asserted-by":"publisher","first-page":"6872","DOI":"10.1109\/TIT.2020.3006846","volume":"66","author":"Z Heng","year":"2020","unstructured":"Heng, Z., Wang, Q., Ding, C.: Two families of optimal linear codes and their subfield codes. IEEE Trans. Inf. Theory 66(11), 6872\u20136883 (2020). https:\/\/doi.org\/10.1109\/TIT.2020.3006846","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1173_CR5","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1109\/TIT.2019.2907276","volume":"65","author":"C Ding","year":"2019","unstructured":"Ding, C., Heng, Z.: The subfield codes of ovoid codes. IEEE Trans. Inf. Theory 65(8), 4715\u20134729 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2907276","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1173_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1008344232130","volume":"15","author":"C Carlet","year":"1998","unstructured":"Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for DES-like cryptosystems. Des. Codes Cryptogr. 15, 125\u2013156 (1998). https:\/\/doi.org\/10.1023\/A:1008344232130","journal-title":"Des. Codes Cryptogr."},{"key":"1173_CR7","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.ffa.2018.12.006","volume":"56","author":"Z Heng","year":"2019","unstructured":"Heng, Z., Ding, C.: The subfield codes of hyperoval and conic codes. Finite Fields Their Appl. 56, 308\u2013331 (2019). https:\/\/doi.org\/10.1016\/j.ffa.2018.12.006","journal-title":"Finite Fields Their Appl."},{"issue":"1","key":"1173_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2004.09.011","volume":"330","author":"C Ding","year":"2005","unstructured":"Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81\u201399 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.09.011","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1173_CR9","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1109\/TIT.2005.847722","volume":"51","author":"C Carlet","year":"2005","unstructured":"Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089\u20132102 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.847722","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1173_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TIT.2008.2008145","volume":"55","author":"C Li","year":"2009","unstructured":"Li, C., Qu, L., Ling, S.: On the covering structures of two classes of linear codes from perfect nonlinear functions. IEEE Trans. Inf. Theory 55(1), 70\u201382 (2009). https:\/\/doi.org\/10.1109\/TIT.2008.2008145","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1173_CR11","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276\u2013279 (1993)"},{"key":"1173_CR12","unstructured":"Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Ciphers: Cryptography and Coding IV, pp. 33\u201347 (1995)"},{"issue":"1","key":"1173_CR13","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TIT.2005.860412","volume":"52","author":"J Yuan","year":"2006","unstructured":"Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206\u2013212 (2006). https:\/\/doi.org\/10.1109\/TIT.2005.860412","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4\u20135","key":"1173_CR14","first-page":"143","volume":"39","author":"AR Calderbank","year":"1984","unstructured":"Calderbank, A.R., Goethals, J.-M.: Three-weight codes and association schemes. Philips J. Res. 39(4\u20135), 143\u2013152 (1984)","journal-title":"Philips J. Res."},{"key":"1173_CR15","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s10623-019-00628-7","volume":"87","author":"M Shi","year":"2019","unstructured":"Shi, M., Sol\u00e9, P.: Three-weight codes, triple sum sets, and strongly walk regular graphs. Des. Codes Cryptogr. 87, 2395\u20132404 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00628-7","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1173_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"R Calderbank","year":"1986","unstructured":"Calderbank, R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97\u2013122 (1986). https:\/\/doi.org\/10.1112\/blms\/18.2.97","journal-title":"Bull. Lond. Math. Soc."},{"issue":"8","key":"1173_CR17","doi-asserted-by":"publisher","first-page":"3741","DOI":"10.1109\/TIT.2008.926410","volume":"54","author":"C Ding","year":"2008","unstructured":"Ding, C., Yin, J.: Sets of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 54(8), 3741\u20133745 (2008). https:\/\/doi.org\/10.1109\/TIT.2008.926410","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1173_CR18","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998). https:\/\/doi.org\/10.1109\/18.705584","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1173_CR19","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1109\/TIT.2022.3203380","volume":"69","author":"Z Heng","year":"2023","unstructured":"Heng, Z.: Projective linear codes from some almost difference sets. IEEE Trans. Inf. Theory 69(2), 978\u2013994 (2023). https:\/\/doi.org\/10.1109\/TIT.2022.3203380","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1173_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge Univ. Press, Cambridge (2003)"},{"key":"1173_CR21","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. North-Holland, Amsterdam (1977)"},{"key":"1173_CR22","volume-title":"Finite Fields","author":"R Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Cambridge Univ. Press, Cambridge (1983)"},{"key":"1173_CR23","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ffa.2017.07.010","volume":"48","author":"G Vega","year":"2017","unstructured":"Vega, G.: An extended characterization of a class of optimal three-weight cyclic codes over any finite field. Finite Fields Their Appl. 48, 160\u2013174 (2017). https:\/\/doi.org\/10.1016\/j.ffa.2017.07.010","journal-title":"Finite Fields Their Appl."},{"issue":"1","key":"1173_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/ffta.2000.0293","volume":"8","author":"B Schmidt","year":"2002","unstructured":"Schmidt, B., White, C.: All two-weight irreducible cyclic codes? Finite Fields Their Appl. 8(1), 1\u201317 (2002). https:\/\/doi.org\/10.1006\/ffta.2000.0293","journal-title":"Finite Fields Their Appl."},{"key":"1173_CR25","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Accessed 2 Feb 2023"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01173-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01173-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01173-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T08:06:14Z","timestamp":1699603574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01173-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1173"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01173-5","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2621988\/v1","asserted-by":"object"}]},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,25]]},"assertion":[{"value":"23 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Both authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}