{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T07:35:28Z","timestamp":1778225728561,"version":"3.51.4"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10623-021-00960-x","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T18:02:35Z","timestamp":1635357755000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A family of linear codes from constant dimension subspace codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Xia","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Yue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8373-9200","authenticated-orcid":false,"given":"Deng","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"960_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S.Y.R., Yeung R.W.: Network information flow. IEEE Trans. Inf. Theory 46, 1204\u20131216 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"960_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1008394205999","volume":"22","author":"R Ahlswede","year":"2001","unstructured":"Ahlswede R., Aydinian H.K., Khachatrian L.H.: On perfect codes and related concepts. Des. Codes Cryptogr. 22(3), 221\u2013237 (2001).","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"960_CR3","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"AE Ashikhmin","year":"1998","unstructured":"Ashikhmin A.E., Barg A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR4","doi-asserted-by":"publisher","first-page":"4152","DOI":"10.1109\/TIT.2019.2891992","volume":"65","author":"D Bartoli","year":"2019","unstructured":"Bartoli D., Bonini M.: Minimal linear codes in odd characteristic. IEEE Trans. Inf. Theory 65, 4152\u20134155 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR5","unstructured":"Belov B.A.: Conjecture on the Griesmer boundary. In: Proceedings of the Optimimization Methods and Their Applications, All Union Summer Sem., Lake Baikal, pp. 100\u2013106 (1972)."},{"key":"960_CR6","unstructured":"Best M.R.: A contribution to the nonexistence of perfect codes. Mathematisch Centrum (1982)."},{"key":"960_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.2140\/pjm.1963.13.389","volume":"13","author":"RC Bose","year":"1963","unstructured":"Bose R.C.: Strongly regular graphs, partial geometries and partially balanced designs. Pac. J. Math. 13, 389\u2013419 (1963).","journal-title":"Pac. J. Math."},{"key":"960_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1112\/blms\/18.2.97","volume":"18","author":"A Calderbank","year":"1986","unstructured":"Calderbank A., Kantor W.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18, 97\u2013122 (1986).","journal-title":"Bull. Lond. Math. Soc."},{"key":"960_CR9","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1007\/s10623-017-0442-5","volume":"86","author":"S Chang","year":"2018","unstructured":"Chang S., Hyun J.Y.: Linear codes from simplicial complexes. Des. Codes Cryptogr. 86, 2167\u20132181 (2018).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"960_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0518015","volume":"18","author":"L Chihara","year":"1987","unstructured":"Chihara L.: On the zeros of the Askey\u2013Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal. 18(1), 191\u2013207 (1987).","journal-title":"SIAM J. Math. Anal."},{"key":"960_CR11","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, 3265\u20133275 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR12","doi-asserted-by":"publisher","first-page":"5835","DOI":"10.1109\/TIT.2015.2473861","volume":"61","author":"K Ding","year":"2015","unstructured":"Ding K., Ding C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory 61, 5835\u20135842 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45066-1_2","volume":"2731","author":"C Ding","year":"2003","unstructured":"Ding C., Yuan J.: Covering and secret sharing with linear codes. Discret. Math. Theor. Comput. Sci. 2731, 11\u201325 (2003).","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"960_CR14","doi-asserted-by":"publisher","first-page":"6536","DOI":"10.1109\/TIT.2018.2819196","volume":"64","author":"C Ding","year":"2018","unstructured":"Ding C., Heng Z., Zhou Z.: Minimal binary linear codes. IEEE Trans. Inf. Theory 64, 6536\u20136545 (2018).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"960_CR15","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TIT.2010.2095232","volume":"57","author":"T Etzion","year":"2011","unstructured":"Etzion T., Vardy A.: Error-correcting codes in projective space. IEEE Trans. Inf. Theory 57(2), 1165\u20131173 (2011).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR16","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/s12095-018-0339-9","volume":"11","author":"Y Gao","year":"2019","unstructured":"Gao Y., Liu Z., Liu Y.: The separation of binary relative three-weight codes and its applications. Cryptogr. Commun. 11, 979\u2013992 (2019).","journal-title":"Cryptogr. Commun."},{"key":"960_CR17","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.laa.2015.10.029","volume":"490","author":"E Gorla","year":"2016","unstructured":"Gorla E., Ravagnani A.: Equidistant subspace codes. Linear Algebra Appl. 490, 48\u201365 (2016).","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"960_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(93)90127-A","volume":"47","author":"N Hamada","year":"1993","unstructured":"Hamada N., Helleseth T., Ytrehus \u00d8.: A new class of nonbinary codes meeting the Griesmer bound. Discret. Appl. Math. 47(3), 219\u2013226 (1993).","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"960_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/TIT.1984.1056867","volume":"30","author":"T Helleseth","year":"1984","unstructured":"Helleseth T.: Further classifications of codes meeting the Griesmer bound. IEEE Trans. Inf. Theory 30(2), 395\u2013403 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0012-365X(92)90553-R","volume":"106\u2013107","author":"T Helleseth","year":"1992","unstructured":"Helleseth T.: Projective codes meeting the Griesmer bound. Discret. Math. 106\u2013107, 265\u2013271 (1992).","journal-title":"Discret. Math."},{"key":"960_CR21","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ffa.2018.08.010","volume":"54","author":"Z Heng","year":"2018","unstructured":"Heng Z., Ding C., Zhou Z.: Minimal linear codes over finite fields. Finite Field Appl. 54, 176\u2013196 (2018).","journal-title":"Finite Field Appl."},{"key":"960_CR22","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 University Press, Cambridge (2003)."},{"issue":"6","key":"960_CR23","doi-asserted-by":"publisher","first-page":"2136","DOI":"10.1109\/18.782159","volume":"45","author":"DB Jaffe","year":"1999","unstructured":"Jaffe D.B., Simonis J.: New binary linear codes which are dual transforms of good codes. IEEE Trans. Inf. Theory 45(6), 2136\u20132137 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR24","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R K\u00f6tter","year":"2008","unstructured":"K\u00f6tter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54, 3579\u20133591 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"960_CR25","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/LCOMM.2020.3024907","volume":"25","author":"X Li","year":"2021","unstructured":"Li X., Shi M.: 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."},{"issue":"2","key":"960_CR26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10623-019-00682-1","volume":"88","author":"X Li","year":"2020","unstructured":"Li X., Yue Q.: Four classes of minimal binary linear codes with $$w_{min}\/w_{max}<1\/2$$ derived from Boolean functions. Des. Codes Cryptogr. 88(2), 257\u2013271 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"960_CR27","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s12095-019-00373-7","volume":"12","author":"X Li","year":"2020","unstructured":"Li X., Fan C., Du X.: A family of distance-optimal minimal linear codes with flexible parameters. Cryptogr. Commun. 12(3), 559\u2013567 (2020).","journal-title":"Cryptogr. Commun."},{"key":"960_CR28","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10623-013-9896-2","volume":"75","author":"Z Liu","year":"2015","unstructured":"Liu Z., Wu W.: On relative constant-weight codes. Des. Codes Cryptogr. 75, 127\u2013144 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"960_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01390772","volume":"6","author":"WJ Martin","year":"1995","unstructured":"Martin W.J., Zhu X.J.: Anticodes for the Grassman and bilinear forms graphs. Des. Codes Cryptogr. 6(1), 73\u201379 (1995).","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"960_CR30","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece R.J., Sarwate D.V.: On sharing secrets and Reed\u2013Solomon codes. Commun. ACM 24(9), 583\u2013584 (1981).","journal-title":"Commun. ACM"},{"issue":"1","key":"960_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jcta.2001.3188","volume":"97","author":"M Schwartz","year":"2002","unstructured":"Schwartz M., Etzion T.: Codes and anticodes in the Grassman graph. J. Combin. Theory A 97(1), 27\u201342 (2002).","journal-title":"J. Combin. Theory A"},{"issue":"11","key":"960_CR32","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979).","journal-title":"Commun. ACM"},{"key":"960_CR33","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.J.: Algebraically punctured cyclic codes. Inf. Control 8, 170\u2013179 (1965).","journal-title":"Inf. Control"},{"issue":"9","key":"960_CR34","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1109\/LCOMM.2017.2707406","volume":"21","author":"D Tang","year":"2017","unstructured":"Tang D., Fan C.: A class of distance-optimal binary linear codes with flexible parameters. IEEE Commun. Lett. 21(9), 1893\u20131896 (2017).","journal-title":"IEEE Commun. Lett."},{"issue":"6","key":"960_CR35","first-page":"3657","volume":"66","author":"Y Wu","year":"2020","unstructured":"Wu Y., Zhu X., Yue Q.: Optimal few-weight codes from simplicial complexes. IEEE Commun. Lett. 66(6), 3657\u20133663 (2020).","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"960_CR36","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"S Xia","year":"2009","unstructured":"Xia S., Fu F.: Johnson type bounds on constant dimension codes. Des. Codes Cryptogr. 50(2), 163\u2013172 (2009).","journal-title":"Des. Codes Cryptogr."},{"key":"960_CR37","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ffa.2018.08.004","volume":"54","author":"H Yan","year":"2018","unstructured":"Yan H., Zhou Z., Du X.: A family of optimal ternary cyclic codes from the Niho-type exponent. Finite Field Appl. 54, 101\u2013112 (2018).","journal-title":"Finite Field Appl."},{"issue":"1","key":"960_CR38","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).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"960_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00200-018-0367-x","volume":"30","author":"W Zhang","year":"2019","unstructured":"Zhang W., Yan H., Wei H.: Four families of minimal binary linear codes with $$w_{\\min }\/w_{\\max }\\le 1\/2$$. Appl. Algebra Eng. Commun. Comput. 30, 175\u2013184 (2019).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"11","key":"960_CR40","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1007\/s10623-017-0454-1","volume":"86","author":"Z Zhou","year":"2018","unstructured":"Zhou Z.: Three-weight ternary linear codes from a family of cyclic difference sets. Des. Codes Cryptogr. 86(11), 2513\u20132523 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"960_CR41","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ffa.2013.08.005","volume":"25","author":"Z Zhou","year":"2014","unstructured":"Zhou Z., Ding C.: A class of three-weight cyclic codes. Finite Field Appl. 25, 79\u201393 (2014).","journal-title":"Finite Field Appl."},{"issue":"2","key":"960_CR42","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10623-015-0144-9","volume":"81","author":"Z Zhou","year":"2016","unstructured":"Zhou Z., Li N., Fan C., Helleseth T.: Linear codes with two or three weights from quadratic bent functions. Des. Codes Cryptogr. 81(2), 283\u2013295 (2016).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00960-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00960-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00960-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T07:18:31Z","timestamp":1641453511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00960-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,27]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["960"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00960-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,27]]},"assertion":[{"value":"16 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}