{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T18:01:31Z","timestamp":1777917691000,"version":"3.51.4"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T00:00:00Z","timestamp":1737676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10623-025-01570-7","type":"journal-article","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T13:49:15Z","timestamp":1737726555000},"page":"1761-1775","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Symmetric (15,\u00a08,\u00a04)-designs in terms of the geometry of binary simplex codes of dimension 4"],"prefix":"10.1007","volume":"93","author":[{"given":"Mark","family":"Pankov","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Petelczyc","sequence":"additional","affiliation":[]},{"given":"Mariusz","family":"\u017bynel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,24]]},"reference":[{"key":"1570_CR1","first-page":"181","volume":"18","author":"A Bonisoli","year":"1984","unstructured":"Bonisoli A.: Every equidistant linear code is a sequence of dual Hamming codes. Ars Combin. 18, 181\u2013186 (1984).","journal-title":"Ars Combin."},{"key":"1570_CR2","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Dinitz J.H. (eds.).: The CRC Handbook of Combinatorial Designs. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1996).","DOI":"10.1201\/9781420049954"},{"key":"1570_CR3","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"1570_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ffa.2018.07.003","volume":"54","author":"M Kwiatkowski","year":"2018","unstructured":"Kwiatkowski M., Pankov M., Pasini A.: The graphs of projective codes. Finite Fields Appl. 54, 15\u201329 (2018).","journal-title":"Finite Fields Appl."},{"key":"1570_CR5","doi-asserted-by":"crossref","unstructured":"Pankov, M., Petelczyc, K., \u017bynel, M.: Point-line geometry related to binary equidistant codes. J. Combin. Theory, Ser. A 210, 105962 (2025).","DOI":"10.1016\/j.jcta.2024.105962"},{"key":"1570_CR6","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1016\/j.jcta.2005.12.006","volume":"113","author":"CE Praeger","year":"2006","unstructured":"Praeger C.E., Zhou S.: Imprimitive flag-transitive symmetric designs. J. Combin. Theory, Ser. A 113, 1381\u20131395 (2006).","journal-title":"J. Combin. Theory, Ser. A"},{"key":"1570_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/0021-8693(68)90099-9","volume":"10","author":"HJ Ryser","year":"1968","unstructured":"Ryser H.J.: An extension of a theorem of de Bruijn and Erd\u0151s on combinatorial designs. J. Algebra 10, 246\u2013261 (1968).","journal-title":"J. Algebra"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01570-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01570-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01570-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:02:36Z","timestamp":1750305756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01570-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,24]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1570"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01570-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,24]]},"assertion":[{"value":"12 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}