{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T16:33:54Z","timestamp":1778949234437,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T00:00:00Z","timestamp":1621555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T00:00:00Z","timestamp":1621555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Hong Kong Research Grants Council","award":["16300418"],"award-info":[{"award-number":["16300418"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871058"],"award-info":[{"award-number":["11871058"]}],"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":[[2021,7]]},"DOI":"10.1007\/s10623-021-00888-2","type":"journal-article","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T12:02:41Z","timestamp":1621598561000},"page":"1713-1734","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The projective general linear group $${\\mathrm {PGL}}(2,2^m)$$ and linear codes of length $$2^m+1$$"],"prefix":"10.1007","volume":"89","author":[{"given":"Cunsheng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9599-851X","authenticated-orcid":false,"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir D.","family":"Tonchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,21]]},"reference":[{"key":"888_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus Jr","year":"1969","unstructured":"Assmus Jr. E.F., Mattson Jr. H.F.: New 5-designs. J. Comb. Theory 6, 122\u2013151 (1969).","journal-title":"J. Comb. Theory"},{"key":"888_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)."},{"key":"888_CR3","volume-title":"Handbook of Magma Functions","author":"W Bosma","year":"1999","unstructured":"Bosma W., Cannon J.: Handbook of Magma Functions. University of Sydney, School of Mathematics and Statistics, Sydney (1999)."},{"key":"888_CR4","volume-title":"Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2007","unstructured":"Colbourn C.J., Dinitz J.F.: Handbook of Combinatorial Designs, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2007).","edition":"2"},{"key":"888_CR5","volume-title":"Linear Groups: With an Exposition of the Galois Field Theory","author":"LE Dickson","year":"1901","unstructured":"Dickson L.E.: Linear Groups: With an Exposition of the Galois Field Theory. Teubner, Leipzig (1901)."},{"issue":"5","key":"888_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. IEEE Trans. Inform. Theory 21(5), 575\u2013576 (1975).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"888_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/11101","volume-title":"Designs from Linear Codes","author":"C Ding","year":"2018","unstructured":"Ding C.: Designs from Linear Codes. World Scientific, Singapore (2018)."},{"issue":"9","key":"888_CR8","doi-asserted-by":"publisher","first-page":"5419","DOI":"10.1109\/TIT.2020.2990396","volume":"66","author":"C Ding","year":"2020","unstructured":"Ding C., Tang C.: Infinite families of near MDS codes holding $$t$$-designs. IEEE Trans. Inform. Theory 66(9), 5419\u20135428 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"888_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jcd.21682","volume":"28","author":"X Du","year":"2020","unstructured":"Du X., Wang R., Fan C.: Infinite families of $$2$$-designs from a class of cyclic codes. J. Comb. Des. 28(3), 157\u2013170 (2020).","journal-title":"J. Comb. Des."},{"issue":"2","key":"888_CR10","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ffa.2010.01.002","volume":"16","author":"M Giorgetti","year":"2010","unstructured":"Giorgetti M., Previtali A.: Galois invariance, trace codes and subfield subcodes. Finite Fields Appl. 16(2), 96\u201399 (2010).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"888_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1515\/advg.2005.5.2.195","volume":"5","author":"M Huber","year":"2005","unstructured":"Huber M.: The classification of flag-transitive Steiner 3-designs. Adv. Geom. 5(2), 195\u2013221 (2005).","journal-title":"Adv. Geom."},{"key":"888_CR12","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":"4","key":"888_CR13","doi-asserted-by":"publisher","first-page":"761","DOI":"10.2307\/2373244","volume":"87","author":"DR Hughes","year":"1965","unstructured":"Hughes D.R.: On $$t$$-designs and groups. Am. J. Math. 87(4), 761\u2013778 (1965).","journal-title":"Am. J. Math."},{"key":"888_CR14","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s10623-018-0502-5","volume":"87","author":"D Jungnickel","year":"2019","unstructured":"Jungnickel D., Magliveras S.S., Tonchev V.D., Wassermann A.: The classification of Steiner triple systems on 27 points with 3-rank 24. Des. Codes Cryptogr. 87, 831\u2013839 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"888_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-012-9636-z","volume":"68","author":"D Jungnickel","year":"2013","unstructured":"Jungnickel D., Tonchev V.D.: New invariants for incidence structures. Des. Codes Cryptogr. 68, 163\u2013177 (2013).","journal-title":"Des. Codes Cryptogr."},{"key":"888_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.jcta.2018.09.009","volume":"162","author":"D Jungnickel","year":"2019","unstructured":"Jungnickel D., Tonchev V.D.: Counting Steiner triple systems with classical parameters and prescribed rank. J. Comb. Theory Ser. A 162, 10\u201333 (2019).","journal-title":"J. Comb. Theory Ser. A"},{"key":"888_CR17","volume-title":"Permutation Groups","author":"DS Passman","year":"1968","unstructured":"Passman D.S.: Permutation Groups. Benjamin, New York (1968)."},{"issue":"10","key":"888_CR18","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1002\/jcd.21663","volume":"27","author":"M Shi","year":"2019","unstructured":"Shi M., Xu L., Krotov D.S.: The number of the non-full-rank Steiner triple systems. J. Comb. Des. 27(10), 571\u2013585 (2019).","journal-title":"J. Comb. Des."},{"issue":"2","key":"888_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/jcd.21685","volume":"28","author":"C Tang","year":"2020","unstructured":"Tang C.: Infinite families of $$3$$-designs from APN functions. J. Comb. Des. 28(2), 97\u2013117 (2020).","journal-title":"J. Comb. Des."},{"issue":"1","key":"888_CR20","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TIT.2020.3032600","volume":"67","author":"C Tang","year":"2021","unstructured":"Tang C., Ding C.: An infinite family of linear codes supporting $$4$$-designs. IEEE Trans. Inform. Theory 67(1), 244\u2013254 (2021).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"888_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1008314923487","volume":"17","author":"VD Tonchev","year":"1999","unstructured":"Tonchev V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121\u2013128 (1999).","journal-title":"Des. Codes Cryptogr."},{"key":"888_CR22","first-page":"677","volume-title":"Handbook of Combinatorial Designs","author":"VD Tonchev","year":"2007","unstructured":"Tonchev V.D.: Codes. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 677\u2013701. CRC Press, New York (2007).","edition":"2"},{"key":"888_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02948948","volume":"12","author":"E Witt","year":"1938","unstructured":"Witt E.: \u00dcber Steinersche Systeme. Abh. Math. Sem. Hamburg 12, 265\u2013275 (1938).","journal-title":"Abh. Math. Sem. Hamburg"},{"issue":"3","key":"888_CR24","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10623-019-00696-9","volume":"88","author":"C Xiang","year":"2020","unstructured":"Xiang C., Ling X., Wang Q.: Combinatorial $$t$$-designs from quadratic functions. Des. Codes Cryptogr. 88(3), 553\u2013565 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"888_CR25","doi-asserted-by":"publisher","first-page":"2727","DOI":"10.1016\/j.disc.2016.05.026","volume":"339","author":"DV Zinoviev","year":"2016","unstructured":"Zinoviev D.V.: The number of Steiner triple systems $$S(2^m - 1, 3, 2)$$ of rank $$2^m -m+2$$ over $$\\mathbb{F}_2$$. Discrete Math. 339, 2727\u20132736 (2016).","journal-title":"Discrete Math."},{"key":"888_CR26","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1134\/S0032946012020020","volume":"48","author":"VA Zinoviev","year":"2012","unstructured":"Zinoviev V.A., Zinoviev D.V.: Steiner triple systems $$S(2^m - 1, 3, 2)$$ of rank $$2^m -m+1$$ over $$\\mathbb{F}_2$$. Probl. Inf. Transm. 48, 102\u2013126 (2012).","journal-title":"Probl. Inf. Transm."},{"key":"888_CR27","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1134\/S0032946013030034","volume":"49","author":"VA Zinoviev","year":"2013","unstructured":"Zinoviev V.A., Zinoviev D.V.: Structure of Steiner triple systems $$S(2^m - 1, 3, 2)$$ of rank $$2^m -m+2$$ over $$\\mathbb{F}_2$$. Probl. Inf. Transm. 49, 232\u2013248 (2013).","journal-title":"Probl. Inf. Transm."},{"key":"888_CR28","first-page":"107","volume":"49","author":"VA Zinoviev","year":"2013","unstructured":"Zinoviev V.A., Zinoviev D.V.: Remark on Steiner triple systems $$ S(2^m - 1, 3, 2)$$ of rank $$2^m -m+1$$ over $$ {{\\mathbb{F}}_2}$$ published in Probl. Peredachi Inf., 2012, no. 2. Probl. Inf. Transm. 49, 107\u2013111 (2013).","journal-title":"Probl. Inf. Transm."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00888-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00888-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00888-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T19:34:31Z","timestamp":1623699271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00888-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,21]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["888"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00888-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,21]]},"assertion":[{"value":"19 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}