{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:59Z","timestamp":1740122519914,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"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","award":["11801353"],"award-info":[{"award-number":["11801353"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2018M632078"],"award-info":[{"award-number":["2018M632078"]}],"id":[{"id":"10.13039\/501100010031","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":[[2020,10]]},"DOI":"10.1007\/s10623-020-00766-3","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T18:03:41Z","timestamp":1596218621000},"page":"2101-2118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relative t-designs in Johnson association schemes for P-polynomial structure"],"prefix":"10.1007","volume":"88","author":[{"given":"Yan","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6106-0272","authenticated-orcid":false,"given":"Naoki","family":"Watamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"issue":"1","key":"766_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.disc.2013.09.013","volume":"314","author":"E Bannai","year":"2014","unstructured":"Bannai E., Bannai E., Bannai H.: On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314(1), 17\u201337 (2014).","journal-title":"Discret. Math."},{"issue":"4","key":"766_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.37236\/4889","volume":"22","author":"E Bannai","year":"2015","unstructured":"Bannai E., Bannai E., Suda S., Tanaka H.: On relative $$t$$-designs in polynomial association schemes. Electron. J. Combin. 22(4), 4\u201347 (2015).","journal-title":"Electron. J. Combin."},{"issue":"1","key":"766_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-016-1739-2","volume":"33","author":"E Bannai","year":"2017","unstructured":"Bannai E., Bannai E., Tanaka H., Zhu Y.: Design theory from the viewpoint of algebraic combinatorics. Graphs Combin. 33(1), 1\u201341 (2017).","journal-title":"Graphs Combin."},{"key":"766_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10623-016-0200-0","volume":"84","author":"E Bannai","year":"2017","unstructured":"Bannai E., Bannai E., Zhu Y.: Relative $$t$$-designs in binary Hamming association scheme $${H}(n, 2)$$. Des. Codes Cryptogr. 84, 23\u201353 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"766_CR5","volume-title":"Algebraic Combinatorics","author":"E Bannai","year":"1984","unstructured":"Bannai E., Ito T.: Algebraic Combinatorics. Benjamin\/Cummings, Menlo Park (1984)."},{"key":"766_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejc.2018.02.024","volume":"80","author":"E Bannai","year":"2019","unstructured":"Bannai E., Zhu Y.: Tight $$t$$-designs on one shell of Johnson association schemes. Eur. J. Combin. 80, 23\u201336 (2019).","journal-title":"Eur. J. Combin."},{"key":"766_CR7","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. PhD thesis, Universite Catholique de Louvain (1973)."},{"issue":"5\u20136","key":"766_CR8","first-page":"373","volume":"32","author":"P Delsarte","year":"1977","unstructured":"Delsarte P.: Pairs of vectors in the space of an association scheme. Philips Res. Rep. 32(5\u20136), 373\u2013411 (1977).","journal-title":"Philips Res. Rep."},{"key":"766_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0024-3795(89)90462-X","volume":"114","author":"Ph Delsarte","year":"1989","unstructured":"Delsarte Ph, Seidel J.J.: Fisher type inequalities for Euclidean $$t$$-designs. Linear Algebra Its Appl. 114, 213\u2013230 (1989).","journal-title":"Linear Algebra Its Appl."},{"issue":"1","key":"766_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00373-012-1252-1","volume":"30","author":"Z Li","year":"2014","unstructured":"Li Z., Bannai E., Bannai E.: Tight relative 2-and 4-designs on binary Hamming association schemes. Graphs Combin. 30(1), 203\u2013227 (2014).","journal-title":"Graphs Combin."},{"issue":"2","key":"766_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/(SICI)1520-6610(1998)6:2<151::AID-JCD5>3.0.CO;2-E","volume":"6","author":"WJ Martin","year":"1998","unstructured":"Martin W.J.: Mixed block designs. J. Combin. Des. 6(2), 151\u2013163 (1998).","journal-title":"J. Combin. Des."},{"issue":"3","key":"766_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1008340128973","volume":"16","author":"WJ Martin","year":"1999","unstructured":"Martin W.J.: Designs in product association schemes. Des. Codes Cryptogr. 16(3), 271\u2013289 (1999).","journal-title":"Des. Codes Cryptogr."},{"key":"766_CR13","unstructured":"Spence E.: Webpage: http:\/\/www.maths.gla.ac.uk\/~es\/bibd\/7-3-7."},{"issue":"2","key":"766_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.disc.2014.09.002","volume":"338","author":"H Yue","year":"2015","unstructured":"Yue H., Hou B., Gao S.: Note on the tight relative 2-designs on $${H} (n, 2)$$. Discret. Math. 338(2), 196\u2013208 (2015).","journal-title":"Discret. Math."},{"issue":"2","key":"766_CR15","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.disc.2015.10.024","volume":"339","author":"Y Zhu","year":"2016","unstructured":"Zhu Y., Bannai E., Bannai E.: Tight relative 2-designs on two shells in Johnson association schemes. Discret. Math. 339(2), 957\u2013973 (2016).","journal-title":"Discret. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00766-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-020-00766-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00766-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:28:01Z","timestamp":1627691281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-020-00766-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":15,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00766-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"5 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}