{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T14:17:44Z","timestamp":1777558664031,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Research Foundation Flanders","doi-asserted-by":"crossref","award":["3E000320"],"award-info":[{"award-number":["3E000320"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["No\u00a0802020-ERC-HARMONIC"],"award-info":[{"award-number":["No\u00a0802020-ERC-HARMONIC"]}],"id":[{"id":"10.13039\/501100007601","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":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>An affine vector space partition of <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$${{\\,\\textrm{AG}\\,}}(n,q)$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mrow>\n                      <mml:mspace\/>\n                      <mml:mtext>AG<\/mml:mtext>\n                      <mml:mspace\/>\n                    <\/mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>q<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> is a set of proper affine subspaces that partitions the set of points. Here we determine minimum sizes and enumerate equivalence classes of affine vector space partitions for small parameters. We also give parametric constructions for arbitrary field sizes.<\/jats:p>","DOI":"10.1007\/s10623-023-01263-z","type":"journal-article","created":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T14:01:26Z","timestamp":1687701686000},"page":"331-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Affine vector space partitions"],"prefix":"10.1007","volume":"93","author":[{"given":"John","family":"Bamberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Filmus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferdinand","family":"Ihringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4597-2041","authenticated-orcid":false,"given":"Sascha","family":"Kurz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,25]]},"reference":[{"key":"1263_CR1","unstructured":"Agievich S.V.: Bent rectangles. In: Boolean Functions in Cryptology and Information Security, volume\u00a018 of NATO Science for Peace and Security Series D: Information and Communication Security (2008)."},{"key":"1263_CR2","unstructured":"Bamberg J., Betten A., Cara P., De\u00a0Beule J., Lavrauw M., Neunh\u00f6ffer M.: FinInG\u2014Finite Incidence Geometry, Version 1.4.1 (2018). http:\/\/www.fining.org."},{"issue":"3","key":"1263_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01215286","volume":"145","author":"A Beutelspacher","year":"1975","unstructured":"Beutelspacher A.: Partial spreads in finite projective spaces and partial designs. Mathematische Zeitschrift 145(3), 211\u2013229 (1975).","journal-title":"Mathematische Zeitschrift"},{"issue":"4","key":"1263_CR4","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10623-018-0571-5","volume":"87","author":"J De Beule","year":"2019","unstructured":"De Beule J., Demeyer J., Mattheus S., Sziklai P.: On the cylinder conjecture. Des. Codes Cryptogr. 87(4), 879\u2013893 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"3\u20134","key":"1263_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1018924526592","volume":"23","author":"G Davydov","year":"1998","unstructured":"Davydov G., Davydova I., B\u00fcning H.K.: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. Math. Artif. Intell. 23(3\u20134), 229\u2013245 (1998).","journal-title":"Ann. Math. Artif. Intell."},{"issue":"6","key":"1263_CR6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1002\/jcd.20247","volume":"18","author":"SI El-Zanati","year":"2010","unstructured":"El-Zanati S.I., Heden O., Seelinger G.F., Sissokho P.A., Spence L.E., Eynden C.V.: Partitions of the $$8$$-dimensional vector space over $$\\operatorname{GF}(2)$$. J. Comb. Des. 18(6), 462\u2013474 (2010).","journal-title":"J. Comb. Des."},{"issue":"14","key":"1263_CR7","doi-asserted-by":"publisher","first-page":"4727","DOI":"10.1016\/j.disc.2008.05.044","volume":"309","author":"SI El-Zanati","year":"2009","unstructured":"El-Zanati S.I., Seelinger G.F., Sissokho P.A., Spence L.E., Eynden C.V.: On partitions of finite vector spaces of low dimension over $$\\operatorname{GF}(2)$$. Discret. Math. 309(14), 4727\u20134735 (2009).","journal-title":"Discret. Math."},{"issue":"4","key":"1263_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.disc.2010.10.026","volume":"311","author":"SI El-Zanati","year":"2011","unstructured":"El-Zanati S.I., Seelinger G.F., Sissokho P.A., Spence L.E., Eynden C.V.: On $$\\lambda $$-fold partitions of finite vector spaces and duality. Discret. Math. 311(4), 307\u2013318 (2011).","journal-title":"Discret. Math."},{"key":"1263_CR9","doi-asserted-by":"crossref","unstructured":"Filmus Y., Hirsch E., Kurz S., Ihringer F., Riazanov A., Smal A., Vinyals M.: Irreducible subcube partitions. arXiv preprint arXiv:2212.14685 (2022).","DOI":"10.37236\/11862"},{"issue":"1","key":"1263_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0195-6698(86)80014-2","volume":"7","author":"O Heden","year":"1986","unstructured":"Heden O.: Partitions of finite abelian groups. Eur. J. Comb. 7(1), 11\u201325 (1986).","journal-title":"Eur. J. Comb."},{"issue":"21","key":"1263_CR11","doi-asserted-by":"publisher","first-page":"6169","DOI":"10.1016\/j.disc.2009.05.026","volume":"309","author":"O Heden","year":"2009","unstructured":"Heden O.: On the length of the tail of a vector space partition. Discret. Math. 309(21), 6169\u20136180 (2009).","journal-title":"Discret. Math."},{"issue":"01","key":"1263_CR12","doi-asserted-by":"publisher","first-page":"1250001","DOI":"10.1142\/S1793830912500012","volume":"4","author":"O Heden","year":"2012","unstructured":"Heden O.: A survey of the different types of vector space partitions. Discret. Math. Algorithms Appl. 4(01), 1250001 (2012).","journal-title":"Discret. Math. Algorithms Appl."},{"key":"1263_CR13","unstructured":"Heinlein D., Honold T., Kiermaier M., Kurz S., Wassermann A.: Projective divisible binary codes. In: The Tenth International Workshop on Coding and Cryptography 2017: WCC Proceedings. IEEE Information Theory Society, Saint-Petersburg, September (2017). https:\/\/eref.uni-bayreuth.de\/40887\/."},{"issue":"1","key":"1263_CR14","first-page":"162","volume":"73","author":"D Heinlein","year":"2019","unstructured":"Heinlein D., Honold T., Kiermaier M., Kurz S.: Generalized vector space partitions. Australas. J. Comb. 73(1), 162\u2013178 (2019).","journal-title":"Australas. J. Comb."},{"key":"1263_CR15","doi-asserted-by":"crossref","unstructured":"Honold T., Kiermaier M., Kurz S.: Partial spreads and vector space partitions. In: Network Coding and Subspace Designs, pp. 131\u2013170. Springer, Berlin (2018).","DOI":"10.1007\/978-3-319-70293-3_7"},{"issue":"1","key":"1263_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00022-018-0459-6","volume":"110","author":"T Honold","year":"2019","unstructured":"Honold T., Kiermaier M., Kurz S.: Classification of large partial plane spreads in $$\\operatorname{PG} (6, 2)$$ and related combinatorial objects. J. Geom. 110(1), 1\u201331 (2019).","journal-title":"J. Geom."},{"issue":"2","key":"1263_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/0218026","volume":"18","author":"K Iwama","year":"1989","unstructured":"Iwama K.: CNF-satisfiability test by counting and polynomial average time. SIAM J. Comput. 18(2), 385\u2013391 (1989).","journal-title":"SIAM J. Comput."},{"issue":"7","key":"1263_CR18","doi-asserted-by":"publisher","first-page":"4051","DOI":"10.1109\/TIT.2020.2968832","volume":"66","author":"M Kiermaier","year":"2020","unstructured":"Kiermaier M., Kurz S.: On the lengths of divisible codes. IEEE Trans. Inf. Theory 66(7), 4051\u20134060 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1263_CR19","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1109\/TIT.2021.3134201","volume":"68","author":"S Kurz","year":"2021","unstructured":"Kurz S., Mattheus S.: A generalization of the cylinder conjecture for divisible codes. IEEE Trans. Inf. Theory 68(4), 2281\u20132289 (2021).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1263_CR20","volume-title":"Classification Algorithms for Codes and Designs","author":"P Kaski","year":"2006","unstructured":"Kaski P., RJ \u00d6sterg\u00e5rd P.: Classification Algorithms for Codes and Designs, vol. 15. Springer, Berlin (2006)."},{"issue":"12","key":"1263_CR21","doi-asserted-by":"publisher","first-page":"3447","DOI":"10.1016\/j.disc.2018.09.003","volume":"341","author":"S Kurz","year":"2018","unstructured":"Kurz S.: Heden\u2019s bound on the tail of a vector space partition. Discret. Math. 341(12), 3447\u20133452 (2018).","journal-title":"Discret. Math."},{"key":"1263_CR22","unstructured":"Kurz S.: Divisible codes. arXiv preprint arXiv:2112.11763 (2021)."},{"key":"1263_CR23","doi-asserted-by":"crossref","unstructured":"Linton S.: Finding the smallest image of a set. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp 229\u2013234 (2004).","DOI":"10.1145\/1005285.1005319"},{"issue":"1","key":"1263_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1002\/jcd.20198","volume":"17","author":"ZT Mateva","year":"2009","unstructured":"Mateva Z.T., Topalova S.T.: Line spreads of $$\\operatorname{PG}(5, 2)$$. J. Comb. Des. 17(1), 90\u2013102 (2009).","journal-title":"J. Comb. Des."},{"issue":"6","key":"1263_CR25","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1016\/j.laa.2011.03.006","volume":"435","author":"EL N\u0103stase","year":"2011","unstructured":"N\u0103stase E.L., Sissokho P.A.: The minimum size of a finite subspace partition. Linear Algebra Appl. 435(6), 1213\u20131221 (2011).","journal-title":"Linear Algebra Appl."},{"key":"1263_CR26","doi-asserted-by":"crossref","unstructured":"Peitl T., Szeider S.: Are hitting formulas hard for resolution? (2022). arXiv:2206.15225.","DOI":"10.1016\/j.dam.2023.05.003"},{"key":"1263_CR27","doi-asserted-by":"crossref","unstructured":"Sheekey J., Schmidt K.-U., Winterhof A.: MRD codes: constructions and connections. In: Combinatorics and finite fields: difference sets, polynomials, pseudorandomness and applications, vol.\u00a023, pp. 255\u2013286. de Gruyter (2019).","DOI":"10.1515\/9783110642094-013"},{"key":"1263_CR28","doi-asserted-by":"crossref","unstructured":"Tarannikov Y.V.: On the existence of Agievich-primitive partitions. Diskretn. Anal. Issled. Oper. Ser. 1 29(4), 104\u2013123 (2022).","DOI":"10.1134\/S1990478922040202"},{"key":"1263_CR29","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ffa.2013.09.007","volume":"25","author":"T Ziran","year":"2014","unstructured":"Ziran T., Zeng X., Lei H.: Several classes of complete permutation polynomials. Finite Fields Appl. 25, 182\u2013193 (2014).","journal-title":"Finite Fields Appl."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01263-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01263-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01263-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T23:58:11Z","timestamp":1739836691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01263-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1263"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01263-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,25]]},"assertion":[{"value":"29 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}