{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T23:52:19Z","timestamp":1778629939785,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T00:00:00Z","timestamp":1576022400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/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":"crossref","award":["11871058"],"award-info":[{"award-number":["11871058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10623-019-00701-1","type":"journal-article","created":{"date-parts":[[2019,12,11]],"date-time":"2019-12-11T03:05:52Z","timestamp":1576033552000},"page":"625-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Linear codes of 2-designs associated with subcodes of the ternary generalized Reed\u2013Muller codes"],"prefix":"10.1007","volume":"88","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":[[2019,12,11]]},"reference":[{"key":"701_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"EF Assmus Jr","year":"1992","unstructured":"Assmus Jr. E.F., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)."},{"key":"701_CR2","first-page":"1269","volume-title":"The Handbook of Coding Theory","author":"EF Assmus Jr","year":"1998","unstructured":"Assmus Jr. E.F., Key J.D.: Polynomial codes and finite geometries. In: Pless V.S., Huffman W.C. (eds.) The Handbook of Coding Theory, vol. II, pp. 1269\u20131343. Elsevier, Amsterdam (1998)."},{"key":"701_CR3","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":"701_CR4","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":"701_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0012-365X(92)90538-Q","volume":"107","author":"PV Ceccherini","year":"1992","unstructured":"Ceccherini P.V., Hirschfeld J.W.P.: The dimension of projective geometry codes. Discret. Math. 107, 117\u2013126 (1992).","journal-title":"Discret. Math."},{"key":"701_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(90)90244-C","volume":"80","author":"P Charpin","year":"1990","unstructured":"Charpin P.: Codes cycliques \u00e9tendus affines-invariants et anticha\u00eenes d\u2019un ensemble partiellement ordonn\u00e9. Discret. Math. 80, 229\u2013247 (1990).","journal-title":"Discret. Math."},{"issue":"5","key":"701_CR7","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\u2013Solomon codes. IEEE Trans. Inf. Theory 21(5), 575\u2013576 (1975).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"701_CR8","volume-title":"Codes from Difference Sets","author":"C Ding","year":"2015","unstructured":"Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015)."},{"key":"701_CR9","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":"10","key":"701_CR10","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1016\/j.disc.2017.05.013","volume":"340","author":"C Ding","year":"2017","unstructured":"Ding C., Li C.: Infinite families of 2-designs and 3-designs from linear codes. Discret. Math. 340(10), 2415\u20132431 (2017).","journal-title":"Discret. Math."},{"key":"701_CR11","doi-asserted-by":"crossref","unstructured":"Du X., Wang R., Fan C.: Infinite families of $$2$$-designs from a class of cyclic codes with two non-zeros. arXiv:1904.04242 [math.CO] (2019).","DOI":"10.1002\/jcd.21682"},{"key":"701_CR12","unstructured":"Grassl M.: Code Tables. http:\/\/www.codetables.de."},{"key":"701_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.32917\/hmj\/1206137446","volume":"3","author":"N Hamada","year":"1973","unstructured":"Hamada N.: On the $$p$$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3, 153\u2013226 (1973).","journal-title":"Hiroshima Math. J."},{"key":"701_CR14","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)."},{"key":"701_CR15","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":"701_CR16","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":"701_CR17","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/S0019-9958(67)90691-2","volume":"11","author":"T Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.: Some results on cyclic codes which are invariant under the affine group and their applications. Inf. Control 11, 475\u2013496 (1968).","journal-title":"Inf. Control"},{"key":"701_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0012-365X(94)00010-G","volume":"142","author":"GT Kennedy","year":"1995","unstructured":"Kennedy G.T., Pless V.: A coding-theoretic approach to extending designs. Discret. Math. 142, 155\u2013168 (1995).","journal-title":"Discret. Math."},{"key":"701_CR19","volume-title":"Finite Fields, Encyclopedia of Mathematics and Its Application","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields, Encyclopedia of Mathematics and Its Application, vol. 20. Cambridge University Press, Cambridge (1997)."},{"key":"701_CR20","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)."},{"issue":"2","key":"701_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10623-006-0006-6","volume":"40","author":"OP Osuna","year":"2006","unstructured":"Osuna O.P.: There are 1239 Steiner triple systems $$STS(31)$$ of 2-rank 27. Des. Codes Cryptogr. 40(2), 187\u2013190 (2006).","journal-title":"Des. Codes Cryptogr."},{"key":"701_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01264073","volume":"48","author":"VD Tonchev","year":"1993","unstructured":"Tonchev V.D.: Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom. Dedic. 48, 295\u2013308 (1993).","journal-title":"Geom. Dedic."},{"key":"701_CR23","first-page":"1229","volume-title":"The Handbook of Coding Theory","author":"VD Tonchev","year":"1998","unstructured":"Tonchev V.D.: Codes and designs. In: Pless V.S., Huffman W.C. (eds.) The Handbook of Coding Theory, vol. II, pp. 1229\u20131268. Elsevier, Amsterdam (1998)."},{"key":"701_CR24","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/jcta.2000.3161","volume":"95","author":"VD Tonchev","year":"2001","unstructured":"Tonchev V.D.: A mass formula for Steiner triple systems $$STS(2^n-1)$$ of 2-rank $$2^n-n$$. J. Comb. Theory Ser. A 95, 197\u2013208 (2001).","journal-title":"J. Comb. Theory Ser. A"},{"key":"701_CR25","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/jcd.10036","volume":"11","author":"VD Tonchev","year":"2003","unstructured":"Tonchev V.D.: A formula for the number of Steiner quadruple systems on $$2^n$$ points of 2-rank $$2^n-n$$. J. Comb. Des. 11, 260\u2013274 (2003).","journal-title":"J. Comb. Des."},{"key":"701_CR26","first-page":"677","volume-title":"The Handbook of Combinatorial Designs","author":"VD Tonchev","year":"2007","unstructured":"Tonchev V.D.: Codes. In: Colbourn C.J., Dinitz J.H. (eds.) The Handbook of Combinatorial Designs, 2nd edn, pp. 677\u2013701. CRC Press, New York (2007).","edition":"2"},{"key":"701_CR27","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$$. Discret. Math. 339, 2727\u20132736 (2016).","journal-title":"Discret. Math."},{"key":"701_CR28","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":"701_CR29","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":"701_CR30","first-page":"107","volume":"49","author":"VA Zinoviev","year":"2013","unstructured":"Zinoviev V.A., Zinoviev D.V.: Remark on \u201cSteiner 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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00701-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00701-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00701-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T01:23:20Z","timestamp":1607563400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00701-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,11]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00701-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,11]]},"assertion":[{"value":"30 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}