{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:33:34Z","timestamp":1761060814018,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"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"}]},{"name":"Hong Kong Research Grants Council","award":["16300418","NHKUST619\/17"],"award-info":[{"award-number":["16300418","NHKUST619\/17"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10623-019-00651-8","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T04:43:21Z","timestamp":1560228201000},"page":"2793-2811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Steiner systems $$S(2, 4, \\frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\\frac{3^m-1}{2}$$"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9599-851X","authenticated-orcid":false,"given":"Chunming","family":"Tang","sequence":"first","affiliation":[]},{"given":"Cunsheng","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Maosheng","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"key":"651_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1026421315292","volume":"15","author":"R Anderson","year":"1998","unstructured":"Anderson R., Ding C., Helleseth T., Klove T.: How to build robust shared control systems. Des. Codes Cryptogr. 15, 111\u2013124 (1998).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"651_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.37236\/1203","volume":"2","author":"EF Assmus Jr","year":"1995","unstructured":"Assmus Jr. E.F.: On $$2$$-ranks of Steiner triple systems. Electron. J. Comb. 2(1), 9 (1995).","journal-title":"Electron. J. Comb."},{"key":"651_CR3","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":"651_CR4","first-page":"1269","volume-title":"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.) Handbook of Coding Theory, vol. II, pp. 1269\u20131343. Elsevier, Amsterdam (1998)."},{"key":"651_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/1016056","volume":"16","author":"EF Assmus Jr","year":"1974","unstructured":"Assmus Jr. E.F., Mattson Jr. H.F.: Coding and combinatorics. SIAM Rev. 16, 349\u2013388 (1974).","journal-title":"SIAM Rev."},{"key":"651_CR6","volume-title":"Codes from Difference Sets","author":"C Ding","year":"2015","unstructured":"Ding C.: Codes from Difference Sets. World Scientific, Singapore (2015)."},{"key":"651_CR7","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10623-017-0352-6","volume":"86","author":"C Ding","year":"2018","unstructured":"Ding C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86, 703\u2013719 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"651_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/jcd.21565","volume":"26","author":"C Ding","year":"2018","unstructured":"Ding C.: An infinite family of Steiner systems from cyclic codes. J. Comb. Des. 26, 127\u2013144 (2018).","journal-title":"J. Comb. Des."},{"key":"651_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)."},{"key":"651_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, 2415\u20132431 (2017).","journal-title":"Discret. Math."},{"key":"651_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ffa.2018.06.006","volume":"53","author":"C Ding","year":"2018","unstructured":"Ding C., Li C., Xia Y.: Another generalization of the binary Reed\u2013Muller codes and its applications. Finite Fields Appl. 53, 144\u2013174 (2018).","journal-title":"Finite Fields Appl."},{"key":"651_CR12","unstructured":"Ding C., Munemasa A., Tonchev V.D.: Bent vectorial functions, codes and designs (2018). \n                    arXiv:1808.08487\n                    \n                   [math.CO]."},{"key":"651_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":"651_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(75)90040-0","volume":"11","author":"H Hanani","year":"1975","unstructured":"Hanani H.: Balanced incomplete block designs and related designs. Discret. Math. 11, 255\u2013369 (1975).","journal-title":"Discret. Math."},{"key":"651_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jcta.2004.03.005","volume":"107","author":"M Harada","year":"2004","unstructured":"Harada M., Kitazume M., Munemasa A.: On a $$5$$-design related to an extremal doubly-even self-dual code of length $$72$$. J. Comb. Theory Ser. A 107, 143\u2013146 (2004).","journal-title":"J. Comb. Theory Ser. A"},{"key":"651_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00026-005-0250-x","volume":"9","author":"M Harada","year":"2005","unstructured":"Harada M., Munemasa A., Tonchev V.D.: A characterization of designs related to an extremal doubly-even self-dual code of length $$48$$. Ann. Comb. 9, 189\u2013198 (2005).","journal-title":"Ann. Comb."},{"key":"651_CR17","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":"651_CR18","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10623-017-0406-9","volume":"86","author":"D Jungnickel","year":"2018","unstructured":"Jungnickel D., Tonchev V.D.: On Bonisoli\u2019s theorem and the block codes of Steiner triple systems. Des. Codes Cryptogr. 86, 449\u2013462 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"651_CR19","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":"651_CR20","unstructured":"Jungnickel D., Magliveras S.S., Tonchev V.D., Wassermann A.: On classifying Steiner triple systems by their $$3$$-rank. In: Bl\u201domer J. et al. (eds.), MACIS 2017, LNCS 10693, pp. 295\u2013305 (2017). Springer, Berlin"},{"key":"651_CR21","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0378-3758(99)00126-3","volume":"86","author":"JH Koolen","year":"2000","unstructured":"Koolen J.H., Munemasa A.: Tight 2-designs and perfect $$1$$-codes in Doob graphs. J. Stat. Plann. Inference 86, 505\u2013513 (2000).","journal-title":"J. Stat. Plann. Inference"},{"key":"651_CR22","doi-asserted-by":"publisher","first-page":"7219","DOI":"10.1109\/TIT.2017.2743687","volume":"63","author":"S Li","year":"2017","unstructured":"Li S., Ding C., Xiong M., Ge G.: Narrow-sense BCH codes over $${\\rm GF}(q)$$ with length $$ n=\\frac{q^{m}-1}{q-1}$$. IEEE Trans. Inf. Theory 63, 7219\u20137236 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"651_CR23","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"key":"651_CR24","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)."},{"key":"651_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disc.2003.11.036","volume":"29","author":"A Munemasa","year":"2004","unstructured":"Munemasa A., Tonchev V.D.: A new quasi-symmetric $$2$$-$$(56,16,6)$$ design obtained from codes. Discret. Math. 29, 231\u2013234 (2004).","journal-title":"Discret. Math."},{"key":"651_CR26","first-page":"1229","volume-title":"Handbook of Coding Theory","author":"VD Tonchev","year":"1998","unstructured":"Tonchev V.D.: Codes and designs. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, vol. II, pp. 1229\u20131268. Elsevier, Amsterdam (1998)."},{"key":"651_CR27","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":"651_CR28","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":"651_CR29","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, 206\u2013212 (2006).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00651-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00651-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00651-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T23:31:18Z","timestamp":1591745478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00651-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,11]]},"references-count":29,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00651-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,6,11]]},"assertion":[{"value":"28 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}