{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:03:09Z","timestamp":1780038189934,"version":"3.53.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:00:00Z","timestamp":1778544000000},"content-version":"vor","delay-in-days":11,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"NSERC General Research Funds grant","award":["University of Waterloo"],"award-info":[{"award-number":["University of Waterloo"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10623-026-01825-x","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T11:03:11Z","timestamp":1778583791000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\lambda $$-fold near-factorizations of groups"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5031-9410","authenticated-orcid":false,"given":"Donald L.","family":"Kreher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3405-3392","authenticated-orcid":false,"given":"Shuxing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5635-8122","authenticated-orcid":false,"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,12]]},"reference":[{"issue":"1","key":"1825_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/0097-3165(94)90007-8","volume":"67","author":"KT Arasu","year":"1994","unstructured":"Arasu K.T., Jungnickel D., Ma S.L., Pott A.: Strongly regular Cayley graphs with $$\\lambda -\\mu =-1$$. J. Combin. Theory Ser. A 67(1), 116\u2013125 (1994). https:\/\/doi.org\/10.1016\/0097-3165(94)90007-8.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"4","key":"1825_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1556\/SScMath.2007.1059","volume":"45","author":"G Bacs\u00f3","year":"2008","unstructured":"Bacs\u00f3 G., H\u00e9thelyi L., Sziklai P.: New near-factorizations of finite groups. Studia Sci. Math. Hungar. 45(4), 493\u2013510 (2008). https:\/\/doi.org\/10.1556\/SScMath.2007.1059.","journal-title":"Studia Sci. Math. Hungar."},{"key":"1825_CR3","doi-asserted-by":"publisher","unstructured":"Berlekamp E.R., van Lint J.H., Seidel J.J.: A strongly regular graph derived from the perfect ternary Golay code. In: A Survey of Combinatorial Theory, pp. 25\u201330. Elsevier, Amsterdam (1973). https:\/\/doi.org\/10.1016\/B978-0-12-189420-7.50012-8.","DOI":"10.1016\/B978-0-12-189420-7.50012-8"},{"key":"1825_CR4","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511549533","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory, vol. 69, 2nd edn Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1999) https:\/\/doi.org\/10.1017\/CBO9780511549533.","edition":"2"},{"issue":"4","key":"1825_CR5","first-page":"15","volume":"3","author":"NG Bruijn","year":"1956","unstructured":"Bruijn N.G.: On number systems. Nieuw Arch. Wisk. 3(4), 15\u201317 (1956).","journal-title":"Nieuw Arch. Wisk."},{"key":"1825_CR6","first-page":"53","volume":"29","author":"D Caen","year":"1990","unstructured":"Caen D., Gregory D.A., Hughes I.G., Kreher D.L.: Near-factors of finite groups. Ars Combin. 29, 53\u201363 (1990).","journal-title":"Ars Combin."},{"key":"1825_CR7","doi-asserted-by":"publisher","unstructured":"Davis J.A., Jedwab J.: A survey of Hadamard difference sets. In: Groups, Difference Sets, and the Monster (Columbus, OH, 1993), vol. 4, pp. 145\u2013156. de Gruyter, Berlin (1996). https:\/\/doi.org\/10.1515\/9783110893106.","DOI":"10.1515\/9783110893106"},{"key":"1825_CR8","unstructured":"Gordon D.M.: La Jolla difference sets repository. https:\/\/zenodo.org\/records\/15442142."},{"key":"1825_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-031-48679-1_12","volume-title":"New Advances in Designs, Codes and Cryptography","author":"J Jedwab","year":"2024","unstructured":"Jedwab J., Li S.: Group rings and character sums: tricks of the trade. In: New Advances in Designs, Codes and Cryptography, vol. 86, pp. 241\u2013266. Springer, New York (2024). https:\/\/doi.org\/10.1007\/978-3-031-48679-1_12."},{"key":"1825_CR10","first-page":"419","volume-title":"Handbook of Combinatorial Designs","author":"D Jungnickel","year":"2007","unstructured":"Jungnickel D., Pott A., Smith K.W.: Difference sets. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 419\u2013435. Chapman & Hall\/CRC, Boca Raton (2007).","edition":"2"},{"key":"1825_CR11","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2411.15890","author":"DL Kreher","year":"2024","unstructured":"Kreher D.L., Martin W.J., Stinson D.R.: Uniqueness and explicit computation of mates in near-factorizations. J. Algebr. Comb. (2024). https:\/\/doi.org\/10.48550\/arXiv.2411.15890.","journal-title":"J. Algebr. Comb."},{"issue":"11","key":"1825_CR12","doi-asserted-by":"publisher","first-page":"5015","DOI":"10.1007\/s10623-025-01715-8","volume":"93","author":"DL Kreher","year":"2025","unstructured":"Kreher D.L., Paterson M.B., Stinson D.R.: Near-factorizations of dihedral groups. Des. Codes Cryptogr. 93(11), 5015\u20135038 (2025). https:\/\/doi.org\/10.1007\/s10623-025-01715-8.","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"1825_CR13","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/jcd.21985","volume":"33","author":"DL Kreher","year":"2025","unstructured":"Kreher D.L., Paterson M.B., Stinson D.R.: Strong external difference families and classification of $$\\alpha $$-valuations. J. Combin. Des. 33(9), 343\u2013356 (2025). https:\/\/doi.org\/10.1002\/jcd.21985.","journal-title":"J. Combin. Des."},{"issue":"6","key":"1825_CR14","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1112\/blms\/27.6.553","volume":"27","author":"KH Leung","year":"1995","unstructured":"Leung K.H., Ma S.L.: Partial difference sets with Paley parameters. Bull. London Math. Soc. 27(6), 553\u2013564 (1995). https:\/\/doi.org\/10.1112\/blms\/27.6.553.","journal-title":"Bull. London Math. Soc."},{"issue":"3","key":"1825_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01388454","volume":"4","author":"SL Ma","year":"1994","unstructured":"Ma S.L.: A survey of partial difference sets. Des. Codes Cryptogr. 4(3), 221\u2013261 (1994). https:\/\/doi.org\/10.1007\/BF01388454.","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1825_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.4169\/amer.math.monthly.121.01.005","volume":"121","author":"MB Nathanson","year":"2014","unstructured":"Nathanson M.B.: Additive systems and a theorem of de Bruijn. Am. Math. Monthly 121(1), 5\u201317 (2014). https:\/\/doi.org\/10.4169\/amer.math.monthly.121.01.005.","journal-title":"Am. Math. Monthly"},{"key":"1825_CR17","doi-asserted-by":"publisher","unstructured":"Paley R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12(1\u20134), 311\u2013320 (1933). https:\/\/doi.org\/10.1002\/sapm1933121311.","DOI":"10.1002\/sapm1933121311"},{"issue":"1\u20133","key":"1825_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0012-365X(02)00755-0","volume":"269","author":"A P\u00eacher","year":"2003","unstructured":"P\u00eacher A.: Partitionable graphs arising from near-factorizations of finite groups. Discret. Math. 269(1\u20133), 191\u2013218 (2003). https:\/\/doi.org\/10.1016\/S0012-365X(02)00755-0.","journal-title":"Discret. Math."},{"issue":"1\u20133","key":"1825_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0012-365X(03)00293-0","volume":"276","author":"A P\u00eacher","year":"2004","unstructured":"P\u00eacher A.: Cayley partitionable graphs and near-factorizations of finite groups. Discret. Math. 276(1\u20133), 295\u2013311 (2004). https:\/\/doi.org\/10.1016\/S0012-365X(03)00293-0.","journal-title":"Discret. Math."},{"issue":"8","key":"1825_CR20","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.jcta.2010.02.008","volume":"117","author":"J Polhill","year":"2010","unstructured":"Polhill J.: Paley partial difference sets in groups of order $$n^4$$ and $$9n^4$$ for any odd $$n>1$$. J. Combin. Theory Ser. A 117(8), 1027\u20131036 (2010). https:\/\/doi.org\/10.1016\/j.jcta.2010.02.008.","journal-title":"J. Combin. Theory Ser. A"},{"key":"1825_CR21","series-title":"CRM Series","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-88-7642-475-5_62","volume-title":"The Seventh European Conference on Combinatorics, Graph Theory and Applications","author":"T Sakuma","year":"2013","unstructured":"Sakuma T., Shinohara H.: Krasner near-factorizations and 1-overlapped factorizations. In: The Seventh European Conference on Combinatorics, Graph Theory and Applications, vol. 6, pp. 391\u2013395. CRM Series. Edizioni della Normale, Pisa (2013). https:\/\/doi.org\/10.1007\/978-88-7642-475-5_62."},{"key":"1825_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.4153\/CJM-1958-008-5","volume":"10","author":"RG Stanton","year":"1958","unstructured":"Stanton R.G., Sprott D.A.: A family of difference sets. Can. J. Math. 10, 73\u201377 (1958). https:\/\/doi.org\/10.4153\/CJM-1958-008-5.","journal-title":"Can. J. Math."},{"issue":"2","key":"1825_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/jcd.21691","volume":"28","author":"Z Wang","year":"2020","unstructured":"Wang Z.: Paley type partial difference sets in abelian groups. J. Combin. Des. 28(2), 149\u2013152 (2020). https:\/\/doi.org\/10.1002\/jcd.21691.","journal-title":"J. Combin. Des."},{"key":"1825_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ffa.2018.11.007","volume":"56","author":"K Yamada","year":"2019","unstructured":"Yamada K., Mishima M., Satoh J., Jimbo M.: Multifold factorizations of cyclic groups into subsets. Finite Fields Appl. 56, 131\u2013149 (2019). https:\/\/doi.org\/10.1016\/j.ffa.2018.11.007.","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-026-01825-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01825-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01825-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T06:20:03Z","timestamp":1780035603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01825-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1825"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01825-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"25 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2026","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"}}],"article-number":"106"}}