{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:16:02Z","timestamp":1781799362319,"version":"3.54.5"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["22-11-00266"],"award-info":[{"award-number":["22-11-00266"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10623-023-01256-y","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T13:02:20Z","timestamp":1686661340000},"page":"3293-3303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Projective tilings and full-rank perfect codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8516-755X","authenticated-orcid":false,"given":"Denis S.","family":"Krotov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,13]]},"reference":[{"key":"1256_CR1","doi-asserted-by":"publisher","unstructured":"Avgustinovich S.V., Gorkunov E.V.: Maximum intersection of linear codes and codes equivalent to linear. J. Appl. Ind. Math. 13(4), 600\u2013605 (2019). https:\/\/doi.org\/10.1134\/S1990478919040021 translated from Diskretn. Anal. Issled. Oper. 26(4), 5\u201315 (2019).","DOI":"10.1134\/S1990478919040021"},{"key":"1256_CR2","doi-asserted-by":"publisher","unstructured":"Avgustinovich S.V., Solov\u2019eva F.I., Heden O.: On ranks and kernels problem of perfect codes. Probl. Inf. Transm. 39(4), 341\u2013345 (2003). https:\/\/doi.org\/10.1023\/B:PRIT.0000011272.10614.8c translated from Probl. Peredachi Inf. 39(4), 30\u201334 (2003).","DOI":"10.1023\/B:PRIT.0000011272.10614.8c"},{"issue":"2","key":"1256_CR3","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0097-3165(84)90010-4","volume":"36","author":"A Blokhuis","year":"1984","unstructured":"Blokhuis A., Lam C.W.H.: More coverings by rook domains. J. Comb. Theory Ser. A 36(2), 240\u2013244 (1984). https:\/\/doi.org\/10.1016\/0097-3165(84)90010-4.","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"1256_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/S0895480195280137","volume":"9","author":"G Cohen","year":"1996","unstructured":"Cohen G., Litsyn S., Vardy A., Z\u00e9mor G.: Tilings of binary spaces. SIAM J. Discret. Math. 9(3), 393\u2013412 (1996). https:\/\/doi.org\/10.1137\/S0895480195280137.","journal-title":"SIAM J. Discret. Math."},{"key":"1256_CR5","unstructured":"den Breeijen S.: Tilings of additive groups. Master\u2019s thesis, Radboud University Nijmegen, 2018. https:\/\/www.math.ru.nl\/~bosma\/Students\/SterredenBreeijenMSc.pdf."},{"issue":"1","key":"1256_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/S0895480104445794","volume":"20","author":"M Dinitz","year":"2006","unstructured":"Dinitz M.: Full rank tilings of finite abelian groups. SIAM J. Discret. Math. 20(1), 160\u2013170 (2006). https:\/\/doi.org\/10.1137\/S0895480104445794.","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"1256_CR7","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/18.335887","volume":"40","author":"T Etzion","year":"1994","unstructured":"Etzion T., Vardy A.: Perfect binary codes: constructions, properties and enumeration. IEEE Trans. Inf. Theory 40(3), 754\u2013763 (1994). https:\/\/doi.org\/10.1109\/18.335887.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1256_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/S0895480196309171","volume":"11","author":"T Etzion","year":"1998","unstructured":"Etzion T., Vardy A.: On perfect codes and tilings: problems and solutions. SIAM J. Discret. Math. 11(2), 205\u2013223 (1998). https:\/\/doi.org\/10.1137\/S0895480196309171.","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"1256_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1017\/S0017089500003803","volume":"20","author":"OH Fraser","year":"1979","unstructured":"Fraser O.H., Gordon B.: Solution to a problem of A. D. Sands. Glasdow Math. J. 20(2), 115\u2013117 (1979). https:\/\/doi.org\/10.1017\/S0017089500003803.","journal-title":"Glasdow Math. J."},{"issue":"6","key":"1256_CR10","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/JRPROC.1949.233620","volume":"37","author":"MJE Golay","year":"1949","unstructured":"Golay M.J.E.: Notes on digital coding. Proc. IRE 37(6), 657 (1949). https:\/\/doi.org\/10.1109\/JRPROC.1949.233620.","journal-title":"Proc. IRE"},{"issue":"2","key":"1256_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950). https:\/\/doi.org\/10.1002\/j.1538-7305.1950.tb00463.x.","journal-title":"Bell Syst. Tech. J."},{"issue":"12","key":"1256_CR12","doi-asserted-by":"publisher","first-page":"6485","DOI":"10.1109\/TIT.2015.2488659","volume":"61","author":"JI Kokkala","year":"2015","unstructured":"Kokkala J.I., Krotov D.S., \u00d6sterg\u00e5rd P.R.J.: On the classification of MDS codes. IEEE Trans. Inf. Theory 61(12), 6485\u20136492 (2015). https:\/\/doi.org\/10.1109\/TIT.2015.2488659.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1256_CR13","doi-asserted-by":"publisher","unstructured":"Krotov D.: Perfect and related codes (dataset). IEEE Dataport (2022). https:\/\/doi.org\/10.21227\/w856-4b70.","DOI":"10.21227\/w856-4b70"},{"key":"1256_CR14","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.33048\/semi.2019.16.122","volume":"16","author":"SA Malyugin","year":"2019","unstructured":"Malyugin S.A.: Systematic and nonsystematic perfect codes of infinite length over finite fields. Sib. \u00c8lektron. Mat. Izv. 16, 1732\u20131751 (2019). https:\/\/doi.org\/10.33048\/semi.2019.16.122. (in Russian).","journal-title":"Sib. \u00c8lektron. Mat. Izv."},{"key":"1256_CR15","doi-asserted-by":"publisher","unstructured":"Malyugin S.A.: Linear perfect codes of infinite length over infinite fields. Sib. \u00c8lektron. Mat. Izv. 17, 1165\u20131182 (2020). https:\/\/doi.org\/10.33048\/semi.2020.17.088.","DOI":"10.33048\/semi.2020.17.088"},{"key":"1256_CR16","unstructured":"Okuda C.: The factorization of abelian groups. PhD thesis, The Pennsylvania State University (1975)."},{"issue":"1","key":"1256_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0218196707003536","volume":"17","author":"PJR \u00d6sterg\u00e5rd","year":"2007","unstructured":"\u00d6sterg\u00e5rd P.J.R., Szab\u00f3 S.: Elementary $$p$$-groups with the R\u00e9dei property. Int. J. Algebra Comput. 17(1), 171\u2013178 (2007). https:\/\/doi.org\/10.1142\/S0218196707003536.","journal-title":"Int. J. Algebra Comput."},{"issue":"2","key":"1256_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10623-004-3989-x","volume":"37","author":"KT Phelps","year":"2005","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M.: Kernels and $$p$$-kernels of $$p^r$$-ary $$1$$-perfect codes. Des. Codes Cryptogr. 37(2), 243\u2013261 (2005). https:\/\/doi.org\/10.1007\/s10623-004-3989-x.","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1256_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1019936019517","volume":"27","author":"KT Phelps","year":"2002","unstructured":"Phelps K.T., Villanueva M.: On perfect codes: rank and kernel. Des. Codes Cryptogr. 27(3), 183\u2013194 (2002). https:\/\/doi.org\/10.1023\/A:1019936019517.","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20132","key":"1256_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1016510804974","volume":"27","author":"KT Phelps","year":"2002","unstructured":"Phelps K.T., Villanueva M.: Ranks of $$q$$-ary $$1$$-perfect codes. Des. Codes Cryptogr. 27(1\u20132), 139\u2013144 (2002). https:\/\/doi.org\/10.1023\/A:1016510804974.","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"1256_CR21","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s10623-018-0506-1","volume":"87","author":"AM Romanov","year":"2019","unstructured":"Romanov A.M.: On non-full-rank perfect codes over finite fields. Des. Codes Cryptogr. 87(5), 995\u20131003 (2019). https:\/\/doi.org\/10.1007\/s10623-018-0506-1.","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1256_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(68)90167-8","volume":"12","author":"J Sch\u00f6nheim","year":"1968","unstructured":"Sch\u00f6nheim J.: On linear and nonlinear single-error-correcting $$q$$-ary perfect codes. Inf. Control 12(1), 23\u201326 (1968). https:\/\/doi.org\/10.1016\/S0019-9958(68)90167-8.","journal-title":"Inf. Control"},{"issue":"7","key":"1256_CR23","doi-asserted-by":"publisher","first-page":"113437","DOI":"10.1016\/j.disc.2023.113437","volume":"346","author":"M Shi","year":"2023","unstructured":"Shi M., Krotov D.S.: An enumeration of $$1$$-perfect ternary codes. Discret. Math. 346(7), 113437 (2023). https:\/\/doi.org\/10.1016\/j.disc.2023.113437.","journal-title":"Discret. Math."},{"issue":"6","key":"1256_CR24","doi-asserted-by":"publisher","first-page":"3841","DOI":"10.1109\/TIT.2018.2883759","volume":"65","author":"M Shi","year":"2019","unstructured":"Shi M., Wu R., Krotov D.S.: On $$Z_p Z_{p^k}$$-additive codes and their duality. IEEE Trans. Inf. Theory 65(6), 3841\u20133847 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2883759.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1256_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-93-86279-22-4","volume-title":"Topics in Factorization of Abelian Groups. Texts and Readings in Mathematics","author":"S Szab\u00f3","year":"2004","unstructured":"Szab\u00f3 S.: Topics in Factorization of Abelian Groups. Texts and Readings in Mathematics, vol. 29. Hindustan Book Agency, Gurgaon (2004) https:\/\/doi.org\/10.1007\/978-93-86279-22-4."},{"issue":"3","key":"1256_CR26","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1112\/S0024610706022861","volume":"73","author":"S Szab\u00f3","year":"2006","unstructured":"Szab\u00f3 S.: Constructions related to the R\u00e9dei property of groups. J. Lond. Math. Soc. II. Ser. 73(3), 701\u2013715 (2006). https:\/\/doi.org\/10.1112\/S0024610706022861.","journal-title":"J. Lond. Math. Soc. II. Ser."},{"issue":"4","key":"1256_CR27","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1016\/j.indag.2012.11.002","volume":"24","author":"S Szab\u00f3","year":"2013","unstructured":"Szab\u00f3 S.: Full-rank factorings of elementary $$p$$-groups by $$Z$$-subsets. Indag. Math. 24(4), 988\u2013995 (2013). https:\/\/doi.org\/10.1016\/j.indag.2012.11.002.","journal-title":"Indag. Math."},{"key":"1256_CR28","doi-asserted-by":"publisher","unstructured":"Szab\u00f3 S., Sands A.D.: Factoring Groups into Subsets, Volume 257 of Lecture Notes in Pure and Applied Mathematics. Chapman and Hall\/CRC, Boca Raton (2009). https:\/\/doi.org\/10.1201\/9781420090475.","DOI":"10.1201\/9781420090475"},{"issue":"1","key":"1256_CR29","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0124010","volume":"24","author":"A Tiet\u00e4v\u00e4inen","year":"1973","unstructured":"Tiet\u00e4v\u00e4inen A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24(1), 88\u201396 (1973). https:\/\/doi.org\/10.1137\/0124010.","journal-title":"SIAM J. Appl. Math."},{"key":"1256_CR30","unstructured":"Wasiljew J.L.: \u00dcber dicht gepackte nichtgruppen-codes. In: Probleme der Kybernetik, vol.\u00a08, pp. 375\u2013378. Akademie-Verlag (1965). Translated from Problemy Kibernetiki 8: 337\u2013339 (1962)."},{"issue":"2","key":"1256_CR31","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1112\/jlms\/s1-27.2.242","volume":"27","author":"SK Zaremba","year":"1952","unstructured":"Zaremba S.K.: Covering problems concerning Abelian groups. J. Lond. Math. Soc. 27(2), 242\u2013246 (1952). https:\/\/doi.org\/10.1112\/jlms\/s1-27.2.242.","journal-title":"J. Lond. Math. Soc."},{"issue":"2","key":"1256_CR32","first-page":"123","volume":"2","author":"V Zinoviev","year":"1973","unstructured":"Zinoviev V., Leontiev V.: The nonexistence of perfect codes over Galois fields. Probl. Control Inf. Theory 2(2), 123\u2013132 (1973).","journal-title":"Probl. Control Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01256-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01256-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01256-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T18:06:03Z","timestamp":1695924363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01256-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":32,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1256"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01256-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,13]]},"assertion":[{"value":"11 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2023","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 author has no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"For this type of study, informed consent is not required.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}