{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:52:07Z","timestamp":1776955927820,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper we use the puncturing and shortening techniques on two already-known classes of optimal cyclic codes in order to obtain three new classes of optimal linear codes achieving the Griesmer bound. The weight distributions for these codes are settled. We also investigate their dual codes and show that they are either optimal or almost optimal with respect to the sphere-packing bound. Moreover, these duals contain classes of almost maximum distance separable codes which are shown to be proper for error detection. Further, some of the obtained optimal linear codes are suitable for constructing secret sharing schemes with nice access structures.<\/jats:p>","DOI":"10.1007\/s00200-024-00653-7","type":"journal-article","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T23:25:40Z","timestamp":1712359540000},"page":"1033-1048","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Obtaining new classes of optimal linear codes by puncturing and shortening optimal cyclic codes"],"prefix":"10.1007","volume":"36","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":[[2024,4,6]]},"reference":[{"issue":"5","key":"653_CR1","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":"13","key":"653_CR2","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1016\/j.disc.2006.09.011","volume":"307","author":"S Ball","year":"2007","unstructured":"Ball, S., Montanucci, E.: Affine blocking sets, three-dimensional codes and the Griesmer bound. Discrete Math. 307(13), 1600\u20131608 (2007). https:\/\/doi.org\/10.1016\/j.disc.2006.09.011","journal-title":"Discrete Math."},{"issue":"12","key":"653_CR3","doi-asserted-by":"publisher","first-page":"4049","DOI":"10.1016\/j.disc.2008.12.002","volume":"309","author":"IG Bouyukliev","year":"2009","unstructured":"Bouyukliev, I.G.: Classification of Griesmer codes and dual transform. Discrete Math. 309(12), 4049\u20134068 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.12.002","journal-title":"Discrete Math."},{"issue":"4\u20135","key":"653_CR4","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."},{"issue":"2","key":"653_CR5","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. London Math. Soc. 18(2), 97\u2013122 (1986). https:\/\/doi.org\/10.1112\/blms\/18.2.97","journal-title":"Bull. London Math. Soc."},{"issue":"6","key":"653_CR6","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2015.2420118","volume":"61","author":"C Ding","year":"2015","unstructured":"Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory 61(6), 3265\u20133275 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2420118","journal-title":"IEEE Trans. Inf. Theory"},{"key":"653_CR7","doi-asserted-by":"publisher","unstructured":"Ding, C., Luo, J., Niederreiter, H.: Two-weight codes punctured from irreducible cyclic codes. In: Li, Y.,\u00a0Ling, S.,\u00a0Niederreiter, H.,\u00a0Wang, H.,\u00a0Xing, C.,\u00a0Zhang, S. (eds.) Proc. 1st Int. Workshop Coding Theory Cryptogr., pp. 119\u2013124. World Scientific, Singapore (2008). https:\/\/doi.org\/10.1142\/9789812832245_0009","DOI":"10.1142\/9789812832245_0009"},{"issue":"6","key":"653_CR8","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1109\/TIT.2007.896886","volume":"53","author":"C Ding","year":"2007","unstructured":"Ding, C., Niederreiter, H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory 53(6), 2274\u20132277 (2007). https:\/\/doi.org\/10.1109\/TIT.2007.896886","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"653_CR9","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":"8","key":"653_CR10","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":"1","key":"653_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/18.567708","volume":"43","author":"R Dodunekova","year":"1997","unstructured":"Dodunekova, R., Dodunekov, S., Klove, T.: Almost-MDS and near-MDS codes for error detection. IEEE Trans. Inf. Theory 43(1), 285\u2013290 (1997). https:\/\/doi.org\/10.1109\/18.567708","journal-title":"IEEE Trans. Inf. Theory"},{"key":"653_CR12","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Last accessed Jun 12, (2023)"},{"key":"653_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0012-365X(92)90553-R","volume":"106\u2013107","author":"T Hellesth","year":"1992","unstructured":"Hellesth, T.: Projective codes meeting the Griesmer bound. Discrete Math. 106\u2013107, 265\u2013271 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90553-R","journal-title":"Discrete Math."},{"issue":"2","key":"653_CR14","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"},{"issue":"6","key":"653_CR15","doi-asserted-by":"publisher","first-page":"3643","DOI":"10.1109\/TIT.2022.3151721","volume":"68","author":"Z Heng","year":"2022","unstructured":"Heng, Z., Ding, C.: The subfield codes of some [q + 1, 2, q] MDS codes. IEEE Trans. Inf. Theory 68(6), 3643\u20133656 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3151721","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"653_CR16","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"},{"key":"653_CR17","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00200-019-00412-z","volume":"32","author":"Z Heng","year":"2021","unstructured":"Heng, Z., Wang, W., Wang, Y.: Projective binary linear codes from special Boolean functions. Appl. Algebra Eng. Commun. 32, 521\u2013552 (2021). https:\/\/doi.org\/10.1007\/s00200-019-00412-z","journal-title":"Appl. Algebra Eng. Commun."},{"issue":"8","key":"653_CR18","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":"653_CR19","doi-asserted-by":"publisher","first-page":"3973","DOI":"10.1007\/s00453-023-01173-5","volume":"85","author":"F Hern\u00e1ndez","year":"2023","unstructured":"Hern\u00e1ndez, F., Vega, G.: The subfield and extended codes of a subclass of optimal three-weight cyclic codes. Algorithmica 85, 3973\u20133995 (2023). https:\/\/doi.org\/10.1007\/s00453-023-01173-5","journal-title":"Algorithmica"},{"key":"653_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, U.K. (2003)"},{"issue":"8","key":"653_CR21","doi-asserted-by":"publisher","first-page":"5119","DOI":"10.1109\/TIT.2021.3087082","volume":"67","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Ding, C., Tang, C.: Shortened linear codes over finite fields. IEEE Trans. Inf. Theory 67(8), 5119\u20135132 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3087082","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"653_CR22","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TIT.2018.2854717","volume":"65","author":"Y Luo","year":"2019","unstructured":"Luo, Y., Xing, C., Yuan, C.: Optimal locally repairable codes of distance 3 and 4 via cyclic codes. IEEE Trans. Inf. Theory 65(2), 1048\u20131053 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2854717","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"653_CR23","doi-asserted-by":"publisher","first-page":"3285","DOI":"10.1109\/TIT.2023.3236955","volume":"69","author":"S Mesnager","year":"2023","unstructured":"Mesnager, S., Qian, L., Cao, X., Yuan, M.: Several families of binary minimal linear codes from two-to-one functions. IEEE Trans. Inf. Theory 69(5), 3285\u20133301 (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3236955","journal-title":"IEEE Trans. Inf. Theory"},{"key":"653_CR24","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00200-021-00527-2","volume":"34","author":"J Ouyang","year":"2023","unstructured":"Ouyang, J., Liu, H., Wang, X.: Several classes of p-ary linear codes with few weights. Appl. Algebra Eng. Commun. Comput. 34, 691\u2013715 (2023). https:\/\/doi.org\/10.1007\/s00200-021-00527-2","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"653_CR25","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":"653_CR26","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G Solomon","year":"1965","unstructured":"Solomon, G., Stiffler, J.: Algebraically punctured cyclic codes. Inf. Control. 8(2), 170\u2013179 (1965). https:\/\/doi.org\/10.1016\/S0019-9958(65)90080-X","journal-title":"Inf. Control."},{"key":"653_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10623-022-01099-z","volume":"91","author":"P Tan","year":"2023","unstructured":"Tan, P., Fan, C., Ding, C., Tang, C., Zhou, Z.: The minimum locality of linear codes. Des. Codes Cryptogr. 91, 83\u2013114 (2023). https:\/\/doi.org\/10.1007\/s10623-022-01099-z","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"653_CR28","doi-asserted-by":"publisher","first-page":"5792","DOI":"10.1109\/TIT.2022.3163813","volume":"68","author":"C Tang","year":"2022","unstructured":"Tang, C., Wang, Q., Ding, C.: The subfield codes and subfield subcodes of a family of MDS codes. IEEE Trans. Inf. Theory 68(9), 5792\u20135801 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3163813","journal-title":"IEEE Trans. Inf. Theory"},{"key":"653_CR29","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."},{"key":"653_CR30","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s12095-022-00601-7","volume":"15","author":"G Vega","year":"2023","unstructured":"Vega, G., Hern\u00e1ndez, F.: The complete weight distribution of a subclass of optimal three-weight cyclic codes. Cryptogr. Commun. 15, 317\u2013330 (2023). https:\/\/doi.org\/10.1007\/s12095-022-00601-7","journal-title":"Cryptogr. Commun."},{"issue":"8","key":"653_CR31","doi-asserted-by":"publisher","first-page":"5133","DOI":"10.1109\/TIT.2021.3088146","volume":"67","author":"X Wang","year":"2021","unstructured":"Wang, X., Zheng, D., Ding, C.: Some punctured codes of several families of binary linear codes. IEEE Trans. Inf. Theory 67(8), 5133\u20135148 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3088146","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"653_CR32","doi-asserted-by":"publisher","first-page":"3780","DOI":"10.1109\/TIT.2022.3145519","volume":"68","author":"C Xiang","year":"2022","unstructured":"Xiang, C., Tang, C., Ding, C.: Shortened linear codes from APN and PN functions. IEEE Trans. Inf. Theory 68(6), 3780\u20133795 (2022). https:\/\/doi.org\/10.1109\/TIT.2022.3145519","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"653_CR33","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":"7","key":"653_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112881","volume":"345","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Du, X., Jin, W.: Weight distributions of two classes of linear codes with five or six weights. Discrete Math. 345(7), 112881 (2022). https:\/\/doi.org\/10.1016\/j.disc.2022.112881","journal-title":"Discrete Math."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00653-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-024-00653-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00653-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T19:22:27Z","timestamp":1757100147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-024-00653-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,6]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["653"],"URL":"https:\/\/doi.org\/10.1007\/s00200-024-00653-7","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,6]]},"assertion":[{"value":"19 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}