Follow
Denis Krotov
Denis Krotov
Sobolev Institute of Mathematics
Verified email at math.nsc.ru - Homepage
Title
Cited by
Cited by
Year
Z4-linear Hadamard and extended perfect codes
DS Krotov
Electronic Notes in Discrete Mathematics 6, 107-112, 2001
1442001
On -Additive Codes and Their Duality
M Shi, R Wu, DS Krotov
IEEE Transactions on Information Theory 65 (6), 3841-3847, 2018
752018
On -dual binary codes
DS Krotov
Information Theory, IEEE Transactions on 53 (4), 1532-1537, 2007
592007
n-Ary quasigroups of order 4
DS Krotov, VN Potapov
SIAM Journal on Discrete Mathematics 23 (2), 561-570, 2009
542009
-linear perfect codes
DS Krotov
Diskretnyi Analiz i Issledovanie Operatsii 7 (4), 78-90, 2000
522000
On the classification of MDS codes
JI Kokkala, DS Krotov, PRJ Östergård
IEEE Transactions on Information Theory 61 (12), 6485-6492, 2015
512015
To the theory of q-ary Steiner and other-type trades
DS Krotov, IY Mogilnykh, VN Potapov
Discrete Mathematics 339 (3), 1150-1157, 2016
442016
On weight distributions of perfect colorings and completely regular codes
DS Krotov
Designs, Codes and Cryptography 61 (3), 315-329, 2011
422011
On reconstructing reducible n-ary quasigroups and switching subquasigroups
D Krotov, V Potapov, P Sokolova
Quasigroups and Related Systems 16 (1), 55-67, 2008
402008
Classification of the Z2Z4-Linear Hadamard Codes and Their Automorphism Groups
DS Krotov, M Villanueva
IEEE Transactions on Information Theory 61 (2), 887-894, 2015
372015
On the Number of -Perfect Binary Codes: A Lower Bound
DS Krotov, SV Avgustinovich
IEEE Transactions on Information Theory 54 (4), 1760-1765, 2008
362008
Asymptotics for the number of n-quasigroups of order 4
V Potapov, D Krotov
Siberian Mathematical Journal 47 (4), 720-731, 2006
332006
Lower bounds for the number of m-quasigroups of order four and of the number of perfect binary codes
DS Krotov
Diskretnyi Analiz i Issledovanie Operatsii 7 (2), 47-53, 2000
252000
On the number of n-ary quasigroups of finite order
VN Potapov, DS Krotov
Discrete Mathematics and Applications 21 (5-6), 575-585, 2011
22*2011
Perfect 2‐colorings of Hamming graphs
EA Bespalov, DS Krotov, AA Matiushev, AA Taranenko, KV Vorob'ev
Journal of Combinatorial Designs 29 (6), 367-396, 2021
212021
On the structure of non-full-rank perfect q-ary codes
O Heden, DS Krotov
Advances in Mathematics of Communications 5 (2), 149-156, 2011
21*2011
On the binary codes with parameters of doubly-shortened 1-perfect codes
DS Krotov
Designs, Codes and Cryptography 57 (2), 181-194, 2010
212010
On reducibility of n-ary quasigroups
DS Krotov
Discrete Mathematics 308 (22), 5289-5297, 2008
21*2008
On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4
DS Krotov
Discrete Mathematics 308 (15), 3322-3334, 2008
18*2008
Trades in combinatorial configurations
DS Krotov
Proc. 12 Int. seminar” Discrete Mathematics and Its Applications”(Moscow, 20 …, 2016
172016
The system can't perform the operation now. Try again later.
Articles 1–20