Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Krotov, Denis Stanislavovich

Total publications: 72 (71)
in MathSciNet: 68 (67)
in zbMATH: 63 (63)
in Web of Science: 56 (55)
in Scopus: 61 (60)
Cited articles: 64
Citations in Math-Net.Ru: 133
Citations in Web of Science: 281
Citations in Scopus: 344
Presentations: 5

Number of views:
This page:5785
Abstract pages:5454
Full texts:1516
References:464
Krotov, Denis Stanislavovich
Professor of Russian Academy of Sciences
Doctor of physico-mathematical sciences (2011)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 8.10.1974
E-mail:
Keywords: combinatorics, completely regular codes, equitable partitions, latin hypercubes.
UDC: 519.143, 621.391.15, 519.72, 519.2, 621.391, 519.173.1, 519.7

Subject:

Study of perfect codes; combinatorial aspects of n-ary quasigroups (latin hypercubes); any other combinatorial configurations that can be represented as completely regular codes or equitable partitions

Biography

1981–1989 — Novosibirsk school 190, class 1v-8v
1989–1991 — Novosibirsk school 25 (gymnasium 3) 10ex-11ex
1991–1995 — Novosibirsk State University, Mech.-Math. Fac.
1995–1997 — Novosibirsk State University, Mech.-Math. Fac., master courses
1997–2000 — Sobolev Institute of Mathematics, PhD
2001–… — Sobolev Institute of Mathematics, senior reseacher, ..., chief reseacher

   
Main publications:
  1. D. S. Krotov, “Perfect Codes in Doob Graphs”, Designs, Codes and Cryptography, 80:1 (2016), 91–102 https://rdcu.be/6gzd, arXiv: 1407.6329  crossref  mathscinet  zmath  isi  elib  scopus
  2. D. S. Krotov, “On Calculation of the Interweight Distribution of an Equitable Partition”, Journal of Algebraic Combinatorics, 40:2 (2014), 373–386 , arXiv: 1303.0002  crossref  mathscinet  zmath  isi  elib  scopus
  3. D. S. Krotov, “On Weight Distributions of Perfect Colorings and Completely Regular Codes”, Designs, Codes and Cryptography, 61:3 (2011), 315–329 , arXiv: 0907.0001  crossref  mathscinet  zmath  isi  elib  scopus
  4. D. S. Krotov, P. R. J. Östergård, O. Pottonen, “On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$”, IEEE Transactions on Information Theory, 57:10 (2011), 6771–6779 , arXiv: 1104.4013  crossref  mathscinet  zmath  isi  elib  scopus
  5. D. S. Krotov, V. N. Potapov, “$n$-Ary Quasigroups of Order $4$”, SIAM Journal on Discrete Mathematics, 23:2 (2009), 561–570 , arXiv: math/0701519  crossref  mathscinet  zmath  isi  elib  scopus
  6. D. S. Krotov, “$Z_4$-linear perfect codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 78–90 , arXiv: 0710.0198 (English translation at http://arxiv.org/abs/0710.0198)  mathnet  mathscinet  zmath  elib

http://www.mathnet.ru/eng/person29456
List of publications on Google Scholar
https://zbmath.org/authors/?q=ai:krotov.denis-s
https://mathscinet.ams.org/mathscinet/MRAuthorID/620515
https://elibrary.ru/author_items.asp?authorid=17861
http://orcid.org/0000-0002-8516-755X
http://www.researcherid.com/rid/L-2862-2013
https://www.scopus.com/authid/detail.url?authorId=14050575000
https://www.researchgate.net/profile/Denis_Krotov
https://arxiv.org/a/krotov_d_1

Full list of publications:
| scientific publications | by years | by types | by times cited in WoS | by times cited in Scopus | common list |



   2021
1. D. S. Krotov, V. N. Potapov, “On multifold packings of radius-1 balls in Hamming graphs”, IEEE Transactions on Information Theory, 67, "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein:6 (2021), 3585–3598 , arXiv: 1902.00023  crossref  mathscinet  zmath  isi  elib  scopus (cited: 1)
2. E. A. Bespalov, D. S. Krotov, A. A. Matiushev, A. A. Taranenko, K. V. Vorobev, “Perfect 2‐colorings of Hamming graphs”, Journal of Combinatorial Designs, 29:6 (2021), 367-396 https://onlinelibrary.wiley.com/share/author/UYZBZKEKTQJVVPN66YAW?target=10.1002/jcd.21771, arXiv: 1911.13151  crossref  mathscinet  isi (cited: 1)  elib  scopus (cited: 1)
3. M. J. Shi, S. K. Wang, X. X. Li, D. S. Krotov, “On the number of frequency hypercubes $F^n(4;2,2)$”, Siberian Mathematical Journal, 62:5 (2021), 951–962 , arXiv: 2005.10887  mathnet  crossref  crossref  zmath  isi

   2020
4. Y. Guan, M. J. Shi, D. S. Krotov, “Steiner triple systems of order 21 with a transversal subdesign TD(3,6)”, Problems of Information Transmission, 56:1 (2020), 23–32 , arXiv: 1905.09081  mathnet  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 1)  elib  elib  scopus (cited: 1)
5. D. S. Krotov, “The existence of perfect codes in Doob graphs”, IEEE Transactions on Information Theory, 66:3 (2020), 1423–1427 , arXiv: 1810.03772  crossref  mathscinet  isi (cited: 1)  scopus (cited: 1)
6. M. Shi, D. Krotov, P. Solé, “A new approach to the Kasami codes of type 2”, IEEE Transactions on Information Theory, 66:4 (2020), 2456–2465 , arXiv: 1810.00015  crossref  mathscinet  isi (cited: 1)  scopus (cited: 1)
7. M. Shi, L. Xu, D. S. Krotov, “On the number of resolvable Steiner triple systems of small 3-rank”, Designs, Codes and Cryptography, 88:6 (2020), 1037–1046 , arXiv: 1907.00266  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus (cited: 1)
8. D. S. Krotov, “On the OA(1536,13,2,7) and related orthogonal arrays”, Discrete Mathematics, 343:2 (2020), 111659 , 11 pp., arXiv: 1905.11371  crossref  mathscinet  zmath  isi (cited: 3)  elib  scopus (cited: 3)
9. E. Ghorbani, S. Kamali, G. B. Khosrovshahi, D. S. Krotov, “On the volumes and affine types of trades”, The Electronic Journal of Combinatorics, 27:1 (2020), #P1.29 , 28 pp., arXiv: 1810.02296  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus
10. D. S. Krotov, K. V. Vorobev, “On unbalanced Boolean functions with best correlation immunity”, The Electronic Journal of Combinatorics, 27:1 (2020), #P1.45 , 24 pp., arXiv: 1812.02166  crossref  mathscinet  zmath  isi (cited: 2)  elib  scopus (cited: 2)

   2019
11. M. Shi, D. Huang, D. Krotov, “Additive perfect codes in Doob graphs”, Designs, Codes and Cryptography, 87:8 (2019), 1857–1869 https://rdcu.be/bcaQW, arXiv: 1806.04834  crossref  mathscinet  zmath  isi (cited: 6)  elib  scopus (cited: 6)
12. M. Shi, R. Wu, D. S. Krotov, “On $Z_pZ_{p^k}$-additive codes and their duality”, IEEE Transactions on Information Theory, 65:6 (2019), 3841–3847 , arXiv: 1809.00008  crossref  mathscinet  zmath  isi (cited: 19)  scopus (cited: 19)
13. M. Shi, D. S. Krotov, P. Solé, “A new distance-regular graph of diameter 3 on 1024 vertices”, Designs, Codes and Cryptography, 87:9 (2019), 2091–2101 https://rdcu.be/biitT, arXiv: 1806.07069  crossref  mathscinet  zmath  isi (cited: 3)  elib  scopus (cited: 2)
14. E. V. Gorkunov, D. S. Krotov, V. N. Potapov, “On the number of autotopies of an $n$-ary qusigroup of order $4$”, Quasigroups and Related Systems, 27:2 (2019), 227–250 http://www.quasigroups.eu/contents/download/2019/27_22.pdf, arXiv: 1903.00188  mathscinet  zmath
15. M. Shi, L. Xu, D. S. Krotov, “The number of the non-full-rank Steiner triple systems”, Journal of Combinatorial Designs, 27:10 (2019), 571–585 , arXiv: 1806.00009  crossref  mathscinet  zmath  isi (cited: 4)  scopus (cited: 4)
16. D. S. Krotov, “On (2n/3−1)-resilient (n,2)-functions”, ISIT 2019 (Paris, France, 7–12 July 2019), IEEE International Symposium on Information Theory - Proceedings, IEEE, 2019, 2957–2961 https://arXiv.org/abs/1902.00022  crossref  isi (cited: 1)  elib  scopus (cited: 1)
17. D. S. Krotov, “On dual codes in the Doob schemes”, ISIT 2019 (Paris, France, 7–12 July 2019), IEEE International Symposium on Information Theory - Proceedings, IEEE, 2019, 1917–1921 https://arxiv.org/abs/1902.00020  crossref  isi (cited: 1)  elib  scopus (cited: 1)
18. D. S. Krotov, V. N. Potapov, “On two-fold packings of radius-1 balls in Hamming graphs”, ISIT 2019 (Paris, France, 7–12 July 2019), IEEE International Symposium on Information Theory - Proceedings, 2019, 2773–2777 https://arxiv.org/abs/1902.00023  crossref  isi (cited: 1)  scopus (cited: 1)
19. D. S. Krotov, V. N. Potapov, “On the cardinality spectrum and the number of latin bitrades of order 3”, Problems of Information Transmission, 55:4 (2019), 343–365 https://rdcu.be/b0Kty  mathnet  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 1)  elib  elib  elib  scopus

   2018
20. D. S. Krotov, “On the gaps of the spectrum of volumes of trades”, Journal of Combinatorial Designs, 26:3 (2018), 119–126  crossref  mathscinet  zmath  isi (cited: 2)  elib  scopus (cited: 2)
21. D. S. Krotov, E. A. Bespalov, “Distance-2 MDS codes and latin colorings in the Doob graphs”, Graphs and Combinatorics, 34:5 (2018), 1001–1017 https://rdcu.be/29aE, arXiv: 1510.01429  crossref  mathscinet  zmath  isi  elib  scopus
22. D. S. Krotov, I. Yu. Mogilnykh, A. Yu. Vasileva, On completely regular codes of covering radius 1 in the halved hypercubes, 2018 (Published online) , 8 pp., arXiv: 1812.03159

   2017
23. D. S. Krotov, “On the Automorphism Groups of the $Z_2 Z_4$-Linear $1$-Perfect and Preparata-Like Codes”, Designs, Codes and Cryptography, 83:1 (2017), 169–177 https://rdcu.be/6gCz, arXiv: 1602.00036  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus (cited: 1)
24. E. A. Bespalov, D. S. Krotov, “MDS codes in Doob graphs”, Problems of Information Transmission, 53:2 (2017), 136–154  mathnet  crossref  mathscinet  mathscinet  zmath  isi (cited: 3)  elib  elib  scopus (cited: 3)
25. D. S. Krotov, “The extended 1-perfect trades in small hypercubes”, Discrete Mathematics, 340:10 (2017), 2559–2572 , arXiv: 1512.03421  crossref  mathscinet  zmath  isi (cited: 6)  elib  scopus (cited: 6)
26. D. S. Krotov, “The minimum volume of subspace trades”, Discrete Mathematics, 340:12 (2017), 2723–2731 , arXiv: 1512.02592  crossref  mathscinet  zmath  isi (cited: 3)  elib  scopus (cited: 3)

   2016
27. D. S. Krotov, “Perfect Codes in Doob Graphs”, Designs, Codes and Cryptography, 80:1 (2016), 91–102 https://rdcu.be/6gzd, arXiv: 1407.6329  crossref  mathscinet  zmath  isi (cited: 7)  elib  scopus (cited: 7)
28. D. S. Krotov, P. R. J. Östergård, O. Pottonen, “Non-Existence of a Ternary Constant Weight (16,5,15;2048) Diameter Perfect Code”, Advances in Mathematics of Communications, 10:2 (2016), 393–399 , arXiv: 1408.6927  crossref  mathscinet  zmath  isi  elib  scopus
29. D. S. Krotov, I. Yu. Mogilnykh, V. N. Potapov, “To the Theory of $q$-ary Steiner and Other-Type Trades”, Discrete Mathematics, 339:3 (2016), 1150–1157 , arXiv: 1412.3792  crossref  mathscinet  zmath  isi (cited: 18)  elib  scopus (cited: 18)
30. E. A. Bespalov, D. S. Krotov, “On one test for the switching separability of graphs modulo $q$”, Siberian Mathematical Journal, 57:1 (2016), 7–17  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus
31. D. S. Krotov, V. N. Potapov, “Constructions of Transitive Latin Hypercubes”, European Journal of Combinatorics, 54 (2016), 51–64 , arXiv: 1303.0004  crossref  mathscinet  zmath  isi (cited: 6)  elib  scopus (cited: 1)
32. S. V. Avgustinovich, D. S. Krotov, A. Yu. Vasil'eva, “Completely regular codes in the infinite hexagonal grid”, Sib. elektron. matem. izv., 13 (2016), 987–1016 , arXiv: 1612.01360  mathnet (cited: 3)  crossref  mathscinet  zmath  isi (cited: 3)  elib  scopus (cited: 2)
33. D. S. Krotov, A. Yu. Vasileva, “On Perfect Codes That Do Not Contain Preparata-like Codes”, Problems of Information Transmission, 52:3 (2016), 284–288 , arXiv: 1512.03048  mathnet  crossref  mathscinet  mathscinet  zmath  isi  elib  scopus
34. E. V. Konstantinova, D. S. Krotov, A. D. Mednykh, “On Graphs and Groups, Spectra and Symmetries held on August 15–28, 2016, Novosibirsk, Russia”, Sib. elektron. matem. izv., 13 (2016), 1369–1382  mathnet  crossref  mathscinet  isi  elib  scopus

   2015
35. D. S. Krotov, M. Villanueva, “Classification of the $Z_2Z_4$-Linear Hadamard Codes and Their Automorphism Groups”, IEEE Transactions on Information Theory, 61:2 (2015), 887–894 , arXiv: 1408.1147  crossref  mathscinet  zmath  isi (cited: 10)  elib  scopus (cited: 11)
36. D. S. Krotov, E. V. Sotnikova, “Embedding in $q$-ary $1$-Perfect Codes and Partitions”, Discrete Mathematics, 338:11 (2015), 1856–1859 , arXiv: 1412.3795  crossref  mathscinet  zmath  isi (cited: 2)  elib (cited: 1)  scopus (cited: 3)
37. D. S. Krotov, “On the Number of Maximum Independent Sets in Doob Graphs”, Siberian Electronic Mathematical Reports, 12 (2015), 508–512 , arXiv: 1612.00007  mathnet (cited: 1)  crossref  mathscinet  zmath  elib  scopus (cited: 3)
38. J. I. Kokkala, D. S. Krotov, P. R. J. Östergård, “On the Classification of MDS Codes”, IEEE Transactions on Information Theory, 61:12 (2015), 6485–6492 , arXiv: 1411.5822  crossref  mathscinet  zmath  isi (cited: 17)  elib  scopus (cited: 16)

   2014
39. D. S. Krotov, “A Partition of the Hypercube into Maximally Nonparallel Hamming Codes”, Journal of Combinatorial Designs, 22:4 (2014), 179–187 , arXiv: 1210.0010  crossref  mathscinet  zmath  isi (cited: 2)  elib  scopus (cited: 2)
40. D. S. Krotov, V. N. Potapov, “Propelinear 1-Perfect Codes from Quadratic Functions”, IEEE Transactions on Information Theory, 60:4 (2014), 2065–2068 , arXiv: 1301.0014  crossref  mathscinet  zmath  isi (cited: 5)  elib (cited: 3)  scopus (cited: 5)
41. D. S. Krotov, “On Calculation of the Interweight Distribution of an Equitable Partition”, Journal of Algebraic Combinatorics, 40:2 (2014), 373–386 , arXiv: 1303.0002  crossref  mathscinet  zmath  isi (cited: 1)  elib  scopus (cited: 2)

   2015
42. K. V. Vorobev, D. S. Krotov, “Bounds for the Size of a Minimal 1-Perfect Bitrade in a Hamming Graph”, Journal of Applied and Industrial Mathematics, 9:1 (2015), 141–146  mathnet  crossref  mathscinet  zmath  elib  elib  scopus (cited: 10)

   2013
43. H. K. Kim, D. S. Krotov, J. Y. Lee, “Matrices Uniquely Determined by Their Lonesums”, Linear Algebra and its Applications, 438:7 (2013), 3107–3123 , arXiv: 1103.4884  crossref  mathscinet  zmath  isi (cited: 3)  elib  scopus (cited: 2)

   2012
44. D. S. Krotov, “On the Binary Codes with Parameters of Triply-Shortened 1-Perfect Codes”, Designs, Codes and Cryptography, 64:3 (2012), 275–283 , arXiv: 1104.0005  crossref  mathscinet  zmath  isi (cited: 6)  elib  scopus (cited: 6)

   2011
45. V. N. Potapov, D. S. Krotov, “On the number of $n$-ary quasigroups of finite order”, Discrete Mathematics and Applications, 21:5-6 (2011), 575–585 , arXiv: 0912.5453  mathnet  crossref  crossref  mathscinet  zmath  elib  elib  scopus (cited: 9)
46. D. S. Krotov, V. N. Potapov, “On Connection Between Reducibility of an $n$-Ary Quasigroup and That of Its Retracts”, Discrete Mathematics, 311:1 (2011), 58–66 , arXiv: 0801.0055  crossref  mathscinet  zmath  isi (cited: 3)  elib (cited: 4)  scopus (cited: 4)
47. D. S. Krotov, “On Weight Distributions of Perfect Colorings and Completely Regular Codes”, Designs, Codes and Cryptography, 61:3 (2011), 315–329 , arXiv: 0907.0001  crossref  mathscinet  zmath  isi (cited: 18)  elib  scopus (cited: 18)
48. O. Heden, D. S. Krotov, “On the Structure of Non-Full-Rank Perfect $q$-Ary Codes”, Advances in Mathematics of Communications, 5:2, A special issue ALCOMA'10 (2011), 149–156 , arXiv: 1001.0001  crossref  mathscinet  zmath  isi (cited: 7)  elib (cited: 6)  scopus (cited: 9)
49. D. S. Krotov, P. R. J. Östergård, O. Pottonen, “On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$”, IEEE Transactions on Information Theory, 57:10 (2011), 6771–6779 , arXiv: 1104.4013  crossref  mathscinet  zmath  isi (cited: 6)  elib (cited: 3)  scopus (cited: 7)

   2010
50. D. S. Krotov, “On the Binary Codes with Parameters of Doubly-Shortened $1$-Perfect Codes”, Designs, Codes and Cryptography, 57:2 (2010), 181–194 , arXiv: 0907.0002  crossref  mathscinet  zmath  isi (cited: 10)  elib (cited: 8)  scopus (cited: 11)

   2011
51. D. S. Krotov, “On connection between the switching separability of a graph and its subgraphs”, Journal of Applied and Industrial Mathematics, 5:2 (2011), 240–246 , arXiv: 1104.0003  mathnet  crossref  mathscinet  zmath  elib  elib  scopus (cited: 1)

   2010
52. D. S. Krotov, V. N. Potapov, “On switching equivalence of $n$-ary quasigroups of order 4 and perfect binary codes”, Problems Inform. Transmission, 46:3 (2010), 219–224  mathnet  crossref  mathscinet  zmath  isi (cited: 1)  elib (cited: 1)  scopus (cited: 3)

   2009
53. D. S. Krotov, V. N. Potapov, “$n$-Ary Quasigroups of Order $4$”, SIAM Journal on Discrete Mathematics, 23:2 (2009), 561–570 , arXiv: math/0701519  crossref  mathscinet  zmath  isi (cited: 20)  elib (cited: 16)  scopus (cited: 23)
54. S. V. Avgustinovich, D. S. Krotov, “Embedding in a Perfect Code”, Journal of Combinatorial Designs, 17:5 (2009), 419–423 , arXiv: 0804.0006  crossref  mathscinet  zmath  isi (cited: 4)  elib (cited: 4)  scopus (cited: 8)

   2008
55. D. S. Krotov, S. V. Avgustinovich, “On the Number of $1$-Perfect Binary Codes: A Lower Bound”, IEEE Transactions on Information Theory, 54:4 (2008), 1760–1765 , arXiv: math/0608278  crossref  mathscinet  zmath  isi (cited: 12)  elib (cited: 7)  scopus (cited: 8)
56. D. S. Krotov, V. N. Potapov, P. V. Sokolova, “On Reconstructing Reducible $n$-Ary Quasigroups and Switching Subquasigroups”, Quasigroups and Related Systems, 16:1 (2008), 55–67 , arXiv: math/0608269  crossref  mathscinet  zmath
57. D. S. Krotov, “On Diameter Perfect Constant-Weight Ternary Codes”, Discrete Mathematics, 308:14 (2008), 3104–3114 , arXiv: math/0509620  crossref  mathscinet  zmath  isi (cited: 1)  elib (cited: 1)  scopus (cited: 2)
58. D. S. Krotov, “On Reducibility of $n$-Ary Quasigroups”, Discrete Mathematics, 308:22 (2008), 5289–5297 , arXiv: math/0607284  crossref  mathscinet  zmath  isi (cited: 6)  elib (cited: 8)  scopus (cited: 7)
59. D. S. Krotov, “On Decomposability of $4$-ary Distance $2$ MDS Codes, Double-Codes, and $n$-Quasigroups of Order $4$”, Discrete Mathematics, 308:15 (2008), 3322–3334 , arXiv: math/0509358  crossref  mathscinet  zmath  isi (cited: 4)  elib (cited: 4)  scopus (cited: 5)
60. D. S. Krotov, “On Irreducible $n$-Ary Quasigroups with Reducible Retracts”, European Journal of Combinatorics, 29:2 (2008), 507–513 , arXiv: math/0607785  crossref  mathscinet  zmath  isi (cited: 5)  elib (cited: 7)  scopus (cited: 7)
61. H. K. Kim, D. S. Krotov, “The Poset Metrics That Allow Binary Codes of Codimension $m$ to Be $m$-, $(m-1)$-, or $(m-2)$-Perfect”, IEEE Transactions on Information Theory, 54:11 (2008), 5241–5246 , arXiv: 0705.2807  crossref  mathscinet  zmath  isi (cited: 7)  elib (cited: 2)  scopus (cited: 8)
62. D. S. Krotov, “On perfect colorings of the halved 24-cube”, Diskretn. Anal. Issled. Oper., 15:5 (2008), 35–46 , arXiv: 0803.0068 (English translation at http://arxiv.org/abs/0803.0068)  mathnet  mathscinet  zmath  elib

   2009
63. Yu. L. Vasil'ev, S. V. Avgustinovich, D. S. Krotov, “On shifting sets in the binary hypercube”, Journal of Applied and Industrial Mathematics, 3:2 (2009), 290–296  mathnet  crossref  mathscinet  zmath  elib  elib  scopus

   2007
64. D. S. Krotov, “$Z_{2^k}$-Dual Binary Codes”, IEEE Transactions on Information Theory, 53:4 (2007), 1532–1537 , arXiv: math/0509325  crossref  mathscinet  zmath  isi (cited: 14)  elib (cited: 2)  scopus (cited: 14)

   2006
65. V. N. Potapov, D. S. Krotov, “Asymptotics for the number of $n$-quasigroups of order 4”, Siberian Mathematical Journal, 47:4 (2006), 720–731 , arXiv: math/0605104  mathnet  crossref  mathscinet  zmath  isi (cited: 21)  elib (cited: 13)  elib (cited: 13)  scopus (cited: 23)

   2004
66. D. S. Krotov, V. N. Potapov, “On Multifold MDS and Perfect Codes That Are Not Splittable into Onefold Codes”, Problems of Information Transmission, 40:1 (2004), 5–12  mathnet  crossref  mathscinet  zmath

   2001
67. D. S. Krotov, “$Z_4$-Linear Hadamard and Extended Perfect Codes”, WCC2001, International Workshop on Coding and Cryptography (Paris, France, 8-12 January 2001), Electronic Notes in Discrete Mathematics, 6, eds. D. Augot, C. Carlet, Elsevier B. V., 2001, 107–112 , arXiv: 0710.0199  crossref  mathscinet  zmath  elib (cited: 9)  scopus (cited: 29)
68. D. S. Krotov, “Inductive Constructions of Perfect Ternary Constant-Weight Codes with Distance 3”, Problems of Information Transmission, 37:1 (2001), 1–9  mathnet  crossref  mathscinet  zmath

   2000
69. D. S. Krotov, “$Z_4$-linear perfect codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 78–90 , arXiv: 0710.0198 (English translation at http://arxiv.org/abs/0710.0198)  mathnet  mathscinet  zmath  elib
70. D. S. Krotov, “Lower bounds for the number of $m$-quasigroups of order four and of the number of perfect binary codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000), 47–53  mathnet  mathscinet  zmath  elib
71. D. S. Krotov, “On a perfect code that contains a given set of perfect codes as subcodes”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:1 (2000), 40–48  mathnet  mathscinet  zmath  elib
72. D. S. Krotov, “Combining Construction of Perfect Binary Codes”, Problems of Information Transmission, 36:4 (2000), 349–353  mathnet  mathscinet  zmath

Presentations in Math-Net.Ru
1. Projective tilings and full-rank perfect codes
D. S. Krotov
2022-ary quasigroups and related topics
September 17, 2021 11:00
2. Совершенные коды и их обобщения: проблема существования
D. S. Krotov

August 9, 2021 11:10
3. Bipartite perfect colorings of the infinite square grid: twin colors and the covering case
D. S. Krotov
2022-ary quasigroups and related topics
October 30, 2020 11:00
4. On the classification of the equitable partitions of the 12-cube with the quotient matrix [[0,12],[4,8]]
D. S. Krotov
2022-ary quasigroups and related topics
September 21, 2018
5. Совершенные комбинаторные структуры
D. S. Krotov
Conference of Professors of the RAS in the Department of Mathematical Sciences of the Russian Academy of Sciences
June 14, 2016 14:05   

Organisations
 
Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022