Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Phone: +7 (383) 363 46 25, +7 (913) 933 14 14
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

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            
2. D. S. Krotov, “On Calculation of the Interweight Distribution of an Equitable Partition”, Journal of Algebraic Combinatorics, 40:2 (2014), 373–386 https://rdcu.be/dJ8wb, arXiv: 1303.0002            
3. D. S. Krotov, “On Weight Distributions of Perfect Colorings and Completely Regular Codes”, Designs, Codes and Cryptography, 61:3 (2011), 315–329 https://rdcu.be/dJ8wf, arXiv: 0907.0001            
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            
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            
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)        

Recent publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 
• 
• 
• 
• 

Organisations:

• Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
• Novosibirsk State University