{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:35:58Z","timestamp":1775054158232,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,26]],"date-time":"2015-03-26T00:00:00Z","timestamp":1427328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10623-015-0066-6","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T07:33:00Z","timestamp":1427268780000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Perfect codes in Doob graphs"],"prefix":"10.1007","volume":"80","author":[{"given":"Denis S.","family":"Krotov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Borges J., Rif\u00e0 J.: A characterization of $$1$$ 1 -perfect additive codes. IEEE Trans. Inf. Theory 45(5), 1688\u20131697 (1999). doi: 10.1109\/18.771247 .","DOI":"10.1109\/18.771247"},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Chihara L.: On the zeros of the Askey-Wilson polynomials, with applications to coding theory. SIAM J. Math. Anal. 18(1), 191\u2013207 (1987). doi: 10.1137\/0518015 .","DOI":"10.1137\/0518015"},{"key":"66_CR3","unstructured":"Cvetkovi\u0107 D.M., Doob M., Sachs H.: Spectra of Graphs: Theory and Application. Academic Press, New York (1980)."},{"key":"66_CR4","doi-asserted-by":"crossref","unstructured":"Etzion T.: Configuration distribution and designs of codes in the Johnson scheme. J. Comb. Des. 15(1), 15\u201334 (2007). doi: 10.1002\/jcd.20102 .","DOI":"10.1002\/jcd.20102"},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Golay M.J.E.: Notes on digital coding. Proc. IRE 37(6), 657 (1949). doi: 10.1109\/JRPROC.1949.233620 .","DOI":"10.1109\/JRPROC.1949.233620"},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"Gordon D.M.: Perfect single error-correcting codes in the Johnson scheme. IEEE Trans. Inf. Theory 52(10), 4670\u20134672 (2006). doi: 10.1109\/TIT.2006.881744 .","DOI":"10.1109\/TIT.2006.881744"},{"key":"66_CR7","unstructured":"G\u00fczeltepe M., Heden O.: Perfect Mannheim, Lipschitz and Hurwitz weight codes. Math. Commun. 19(2), 253\u2013276 (2014)."},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"Hamming R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147\u2013160 (1950).","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Heden O.: On perfect codes over non prime power alphabets. In: Bruen A.A., Wehlau D.L. (eds.) Error-Correcting Codes, Finite Geometries and Cryptography, vol. 523, pp. 173\u2013184. Contemporary Mathematics\/AMS, Providence (2010). doi: http:\/\/dx.doi.org\/10.1090\/conm\/523 .","DOI":"10.1090\/conm\/523"},{"key":"66_CR10","unstructured":"Heden O., G\u00fczeltepe M.: On perfect 1 $$\\cal E$$ E -error-correcting codes. Math. Commun. 20(1), to appear (2015)."},{"key":"66_CR11","doi-asserted-by":"crossref","unstructured":"Koolen J.H., Munemasa A.: Tight $$2$$ 2 -designs and perfect $$1$$ 1 -codes in Doob graphs. J. Stat. Plann. Inference 86(2), 505\u2013513 (2000). doi: 10.1016\/S0378-3758(99)00126-3 .","DOI":"10.1016\/S0378-3758(99)00126-3"},{"key":"66_CR12","doi-asserted-by":"crossref","unstructured":"Martin W.J., Zhu X.J.: Anticodes for the Grassman and bilinear forms graphs. Des. Codes Cryptogr. 6(1), 73\u201379 (1995). doi: 10.1007\/BF01390772 .","DOI":"10.1007\/BF01390772"},{"key":"66_CR13","doi-asserted-by":"crossref","unstructured":"Mollard M.: A generalized parity function and its use in the construction of perfect codes. SIAM J. Algebr. Discret. Methods 7(1), 113\u2013115 (1986). doi: 10.1137\/0607013 .","DOI":"10.1137\/0607013"},{"key":"66_CR14","doi-asserted-by":"crossref","unstructured":"Phelps K.T.: A product construction for perfect codes over arbitrary alphabets. IEEE Trans. Inf. Theory 30(5), 769\u2013771 (1984). doi: 10.1109\/TIT.1984.1056963 .","DOI":"10.1109\/TIT.1984.1056963"},{"key":"66_CR15","doi-asserted-by":"crossref","unstructured":"Tiet\u00e4v\u00e4inen A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24(1), 88\u201396 (1973). doi: 10.1137\/0124010 .","DOI":"10.1137\/0124010"},{"key":"66_CR16","unstructured":"Zinoviev V., Leontiev V.: The nonexistence of perfect codes over Galois fields. Probl. Control Inf. Theory 2(2), 123\u2013132, 16\u201324 [Engl. transl.] (1973)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0066-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0066-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0066-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T07:18:09Z","timestamp":1566458289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0066-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,26]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["66"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0066-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,26]]}}}