{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T05:43:10Z","timestamp":1791870190642,"version":"4.3.4"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["22-11-00266"],"award-info":[{"award-number":["22-11-00266"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619341","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"121-126","source":"Crossref","is-referenced-by-count":1,"title":["On the Existence of Some Completely Regular Codes in Hamming Graphs"],"prefix":"10.1109","author":[{"given":"Denis S.","family":"Krotov","sequence":"first","affiliation":[{"name":"Sobolev Institute of Mathematics,Novosibirsk,Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21771"},{"key":"ref2","first-page":"1","article-title":"Group divisible de-signs with block-size four","volume-title":"Discrete Math.","volume":"20","author":"Brouwer","year":"1977"},{"issue":"1","key":"ref3","first-page":"31","article-title":"18-run nonisomorphic three level orthogonal arrays","volume-title":"Metrika","volume":"66","author":"Evangelaras","year":"2007"},{"key":"ref4","article-title":"Classification Algorithms for Codes and Designs, ser","volume":"15","author":"Kaski","year":"2006","journal-title":"Algorithms Comput. Math. Berlin: Springer"},{"key":"ref5","first-page":"2008","article-title":"libexact users guide, version 1.0","volume-title":"Helsinki Institute for Information Technology HIlT, Tech. Rep.","author":"Kaski","year":"2008"},{"key":"ref6","volume-title":"Completely regular codes: Tables","author":"Koolen","year":"2016\u20132024"},{"key":"ref7","article-title":"Perfect and related codes","volume-title":"IEEE Dataport","author":"Krotov","year":"2022\u20132024"},{"issue":"3","key":"ref8","first-page":"315","article-title":"On weight distributions of perfect colorings and completely regular codes","volume-title":"Des. Codes Cryptography","volume":"61","author":"Krotov","year":"2011"},{"issue":"2","key":"ref9","first-page":"111 659\/1","article-title":"On the OA(1536, 13, 2, 7) and related orthogonal ar-rays","volume-title":"Discrete Math.","volume":"343","author":"Krotov","year":"2020"},{"issue":"5","key":"ref10","first-page":"113923\/1","article-title":"The classification of orthogonal arrays OA(2048, 14,2,7) and some completely regular codes","volume-title":"Discrete Math.","volume":"347","author":"Krotov","year":"2024"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/s12095-024-00716-z","article-title":"Equitable [[2, 10], [6, 6]]-partitions of the 12-cube","volume-title":"Cryptogr. Commun.","author":"Krotov","year":"2024"},{"key":"ref12","first-page":"94","article-title":"Practical graph isomorphism, II","volume-title":"J. Symb. Comput.","volume":"60","author":"McKay","year":"2014"},{"key":"ref13","first-page":"231","article-title":"PBDs and GDDs: The basics","volume-title":"Handbook of Combinatorial Designs, 2nd ed., ser. Discrete Mathematics and Its Applications","author":"Mullin","year":"2006"},{"key":"ref14","article-title":"Cliquer users guide, version 1.0","author":"Niskanen","year":"2003","journal-title":"Communications Laboratory, Helsinki University of Technology, Espoo, Finland, Tech. Rep. Y48"},{"issue":"2","key":"ref15","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/18.556115","article-title":"Translation-invariant propelinear codes","volume":"43","author":"Rifa","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"ref16","first-page":"193","article-title":"Completely regular codes and completely transitive codes","volume-title":"Discrete Math.","volume":"81","author":"Sole","year":"1990"},{"issue":"2","key":"ref17","first-page":"151","article-title":"Local and interweight spectra of completely regular codes and of perfect colorings","volume-title":"Probl. Inf. Transm.","volume":"45","author":"Vasileva","year":"2009"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619341.pdf?arnumber=10619341","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:09Z","timestamp":1773347349000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619341\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619341","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}