55 citations · 628 across the 77 of their papers we have counts for
7 papers · 1 filter
Embedding in -ary -perfect codes and partitions
Denis S. Krotov, Evgeniya V. Sotnikova
We prove that every -error-correcting code over a finite field can be embedded in a -perfect code of some larger length. Embedding in this context means that the original cod…
On a test on switching separability of graphs modulo
Evgeny Bespalov, Denis Krotov
We consider the graphs whose edges are marked by the integers (weights) from to (zero corresponds to no-edge). Such graph is called additive if its vertices can be marked…
To the theory of -ary Steiner and other-type trades
Denis Krotov, Ivan Mogilnykh, Vladimir Potapov
We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner bitrades, extended -perfect bitra…
On the Classification of MDS Codes
Janne I. Kokkala, Denis S. Krotov, Patric R. J. Östergård
A -ary code of length , size , and minimum distance is called an code. An code is called a maximum distance separable (MDS) code. In th…
Non-existence of a ternary constant weight diameter perfect code
Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen
Ternary constant weight codes of length , weight , cardinality and distance are known to exist for every for which there exists an APN permutation of orde…
Classification of the Z2Z4-linear Hadamard codes and their automorphism groups
Denis Krotov, Mercè Villanueva
A -linear Hadamard code of length is a binary Hadamard code which is the Gray map image of a -additive code with binary coordinates and quaternar…