{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:08:21Z","timestamp":1761800901728,"version":"build-2065373602"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T00:00:00Z","timestamp":1755129600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T00:00:00Z","timestamp":1755129600000},"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,11]]},"DOI":"10.1007\/s10623-025-01693-x","type":"journal-article","created":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T09:31:06Z","timestamp":1755163866000},"page":"4951-4980","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the support weight distributions of relative subcodes of some classes of codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Decai","family":"Wen","sequence":"first","affiliation":[]},{"given":"Guoyuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zihui","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,14]]},"reference":[{"key":"1693_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.4169\/amer.math.monthly.122.04.367","volume":"122","author":"M Adamaszek","year":"2015","unstructured":"Adamaszek M.: Face numbers of down-sets. Am. Math. Mon. 122, 367\u2013370 (2015).","journal-title":"Am. Math. Mon."},{"key":"1693_CR2","doi-asserted-by":"crossref","unstructured":"Chen W.D., Kl\u00f8ve T.: The weight hierarchies of $$q$$-ary codes of dimension 4. IEEE Trans. Inform. Theory 42(6, part 2), 2265\u20132272 (1996).","DOI":"10.1109\/18.556621"},{"issue":"6","key":"1693_CR3","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1109\/18.340452","volume":"40","author":"GD Forney","year":"1994","unstructured":"Forney G.D.: Dimension\/length profiles and trellis complexity of linear block codes. IEEE Trans. Inform. Theory 40(6), 1741\u20131752 (1994).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1693_CR4","doi-asserted-by":"publisher","first-page":"503","DOI":"10.3934\/amc.2017041","volume":"11","author":"O Geil","year":"2017","unstructured":"Geil O., Martin S.: Relative generalized Hamming weights of q -ary Reed-Muller codes. Adv. Math. Commun. 11(3), 503\u2013531 (2017).","journal-title":"Adv. Math. Commun."},{"issue":"10","key":"1693_CR5","doi-asserted-by":"publisher","first-page":"5938","DOI":"10.1109\/TIT.2014.2345375","volume":"60","author":"O Geil","year":"2014","unstructured":"Geil O., Martin S., Matsumoto R., Ruano D., Luo Y.: Relative generalized Hamming weights of one-point algebraic geometric codes. IEEE Trans. Inform. Theory 60(10), 5938\u20135949 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1693_CR6","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198502951.001.0001","volume-title":"Projective Geometries Over Finite Fields","author":"JWP Hirschfeld","year":"1998","unstructured":"Hirschfeld J.W.P.: Projective Geometries Over Finite Fields. Oxford Mathematical Monographs. Oxford Science Publications, Oxford University Press, New York (1998)."},{"key":"1693_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.dam.2018.07.007","volume":"254","author":"JY Hyun","year":"2019","unstructured":"Hyun J.Y., Kim H.K., Na M.: Optimal non-projective linear codes constructed from down-sets. Discrete Appl. Math. 254, 135\u2013145 (2019).","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"1693_CR8","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/LCOMM.2020.3024907","volume":"25","author":"XX Li","year":"2021","unstructured":"Li X.X., Shi M.J.: A new family of optimal binary few-weight codes from simplicial complexes. IEEE Commun. Lett. 25(4), 1048\u20131051 (2021).","journal-title":"IEEE Commun. Lett."},{"key":"1693_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10623-008-9170-1","volume":"48","author":"ZH Liu","year":"2008","unstructured":"Liu Z.H., Chen W.D., Luo Y.: The relative generalized Hamming weight of linear $$q$$-ary codes and their subcodes. Des. Codes Cryptogr. 48, 111\u2013123 (2008).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1693_CR10","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1109\/TIT.2022.3217078","volume":"69","author":"Y Luo","year":"2023","unstructured":"Luo Y., Liu Z.H.: On the subcode-support-weight distributions of some classes of optimal codes. IEEE Trans. Inform. Theory 69(3), 1531\u20131543 (2023).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1693_CR11","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/TIT.2004.842763","volume":"51","author":"Y Luo","year":"2005","unstructured":"Luo Y., Mitrpant C., Han Vinck A.J., Chen K.F.: Some new characters on the wire-tap channel of type II. IEEE Trans. Inform. Theory 51(3), 1222\u20131229 (2005).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"1693_CR12","doi-asserted-by":"publisher","first-page":"4191","DOI":"10.1109\/TIT.2018.2823326","volume":"64","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as U.: Communication efficient and strongly secure secret sharing schemes based on algebraic geometry codes. IEEE Trans. Inform. Theory 64(6), 4191\u20134206 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1693_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.101994","volume":"80","author":"MJ Shi","year":"2022","unstructured":"Shi M.J., Li X.X.: Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image. Finite Fields Appl. 80, 101994 (2022).","journal-title":"Finite Fields Appl."},{"key":"1693_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.dam.2020.10.027","volume":"290","author":"MJ Shi","year":"2021","unstructured":"Shi M.J., Li X.X.: Two classes of optimal $$p$$-ary few-weight codes from down-sets. Discrete Appl. Math. 290, 60\u201367 (2021).","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"1693_CR15","doi-asserted-by":"publisher","first-page":"6316","DOI":"10.1109\/TIT.2024.3436923","volume":"70","author":"MJ Shi","year":"2024","unstructured":"Shi M.J., Li S.T., Helleseth T.: The weight enumerator polynomials of the lifted codes of the projective Solomon-Stiffler codes. IEEE Trans. Inform. Theory 70(9), 6316\u20136325 (2024).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1693_CR16","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"VK Wei","year":"1991","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory 37(5), 1412\u20131418 (1991).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1693_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.dam.2020.01.019","volume":"283","author":"YS Wu","year":"2020","unstructured":"Wu Y.S., Hyun J.Y.: Few-weight codes over $${\\mathbb{F} }_p$$$$+$$$$u{\\mathbb{F} }_p$$ associated with down sets and their distance optimal Gray image. Discrete Appl. Math. 283, 315\u2013322 (2020).","journal-title":"Discrete Appl. Math."},{"key":"1693_CR18","doi-asserted-by":"crossref","unstructured":"Zhuang Z.J., Luo Y., Han Vinck A.J., Dai B.: Some new bounds on relative generalized Hamming weight. In: 2011 IEEE 13th International Conference on Communication Technology, pp. 971\u2013974 (2011).","DOI":"10.1109\/ICCT.2011.6158023"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01693-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01693-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01693-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:03:21Z","timestamp":1761800601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01693-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,14]]},"references-count":18,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1693"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01693-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,8,14]]},"assertion":[{"value":"20 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 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"}}]}}