Victor Alexandrovich Zinoviev
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Victor Alexandrovich Zinoviev has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Josep Rifà
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
13 shared publications - Joaquim Borges
Department of Information and Communications Engineering Universitat Autònoma de Barcelona Spain
12 shared publications - Dmitrii Zinoviev
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
9 shared publications - Leonid Bassalygo
Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
7 shared publications - Tor Helleseth
Department of Informatics, University of Bergen, Bergen, Norway
5 shared publications D. V. Zinoviev
Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia
2 shared publications
Latest Publications
- Open Access
- 19 May 2026
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 55, 442-447
On the ternary extended perfect Golay code by the modified GC-construction
It is shown that the ternary extended perfect Golay [12, 6, 6]_3-code can be constructed by the modified GC-construction. For the binary Golay [24, 12, 8]-code this has been shown by us earlier. In particular, the Golay [12, 6, 6]_3-code can be constructed using the GC-construction with the inner codes of length 3 and the outer codes of length 4.
- 19 May 2026
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 55, 442-447
Open AccessOn the ternary extended perfect Golay code by the modified GC-construction
It is shown that the ternary extended perfect Golay [12, 6, 6]_3-code can be constructed by the modified GC-construction. For the binary Golay [24, 12, 8]-code this has been shown by us earlier. In particular, the Golay [12, 6, 6]_3-code can be constructed using the GC-construction with the inner codes of length 3 and the outer codes of length 4.
- Open Access
- 19 May 2026
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 55, 350-356
On maximum distance separable and completely regular codes
We investigate when a maximum distance separable (MDS) code over Fq is also completely regular (CR). For lengths n = q + 1 and n = q + 2 we provide a complete classification of the MDS codes that are CR or at least uniformly packed in the wide sense (UPWS). For the more restricted case n <= q with q <= 5 we obtain a full classification (up to equivalence) of all nontrivial MDS codes: there are none for q = 2; only the ternary Hamming code for q = 3; four nontrivial families for q = 4; and exactly six linear MDS codes for q = 5 (three of which are CR and one admits a self-dual version). Additionally, we close two gaps left open in a previous classification of self-dual CR codes with covering radius ρ <= 3: we precisely determine over which finite fields the MDS self-dual completely regular codes with parameters [2, 1, 2]_q and [4, 2, 3]_q exist.
- 19 May 2026
- Published by Institute of Mathematics and Informatics Bulgarian Academy of Sciences in Mathematics and Education in Mathematics
- Vol. 55, 350-356
Open AccessOn maximum distance separable and completely regular codes
We investigate when a maximum distance separable (MDS) code over Fq is also completely regular (CR). For lengths n = q + 1 and n = q + 2 we provide a complete classification of the MDS codes that are CR or at least uniformly packed in the wide sense (UPWS). For the more restricted case n <= q with q <= 5 we obtain a full classification (up to equivalence) of all nontrivial MDS codes: there are none for q = 2; only the ternary Hamming code for q = 3; four nontrivial families for q = 4; and exactly six linear MDS codes for q = 5 (three of which are CR and one admits a self-dual version). Additionally, we close two gaps left open in a previous classification of self-dual CR codes with covering radius ρ <= 3: we precisely determine over which finite fields the MDS self-dual completely regular codes with parameters [2, 1, 2]_q and [4, 2, 3]_q exist.
- Open Access
- 29 March 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 105
On self-dual completely regular codes with covering radius ρ ≤ 3
- 29 March 2025
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 105
Open AccessOn self-dual completely regular codes with covering radius ρ ≤ 3
- 10 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (1) , 1-12
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound
We present two new families of resolvable block designs. We introduce the notion of a weakly resolvable block design and prove the equivalence of such designs and nonbinary codes meeting the Johnson bound. We construct a new family of such codes.
- 10 April 2022
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 58 (1) , 1-12
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound
We present two new families of resolvable block designs. We introduce the notion of a weakly resolvable block design and prove the equivalence of such designs and nonbinary codes meeting the Johnson bound. We construct a new family of such codes.
- 1 January 2021
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 57 (1) , 70-83
On the Generalized Concatenated Construction for Codes in ${L_1}$ and Lee MetricsWe consider a generalized concatenated construction for error-correcting codes over the q-ary alphabet in the modulus metric L1 and Lee metric L. Resulting codes have arbitrary length, arbitrary distance (independently of the alphabet size), and can correct both independent errors and error bursts in both metrics. In particular, for any length 2m we construct codes over \(\mathbb{Z}_4\) with Lee distance 4 which under the Gray mapping yield extended binary perfect codes of length 2m+1 (with code distance 4). We construct codes over \(\mathbb{Z}_4\) of length n with Lee distance n which under the Gray mapping yield Hadamard matrices of order 2n (under the additional condition that an Hadamard matrix of order n exists). The constructed new codes in the Lee metric are often better in their parameters than previously known ones; in particular, they are essentially better than previously constructed Astola codes.- 1 January 2021
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 57 (1) , 70-83
On the Generalized Concatenated Construction for Codes in ${L_1}$ and Lee MetricsWe consider a generalized concatenated construction for error-correcting codes over the q-ary alphabet in the modulus metric L1 and Lee metric L. Resulting codes have arbitrary length, arbitrary distance (independently of the alphabet size), and can correct both independent errors and error bursts in both metrics. In particular, for any length 2m we construct codes over \(\mathbb{Z}_4\) with Lee distance 4 which under the Gray mapping yield extended binary perfect codes of length 2m+1 (with code distance 4). We construct codes over \(\mathbb{Z}_4\) of length n with Lee distance n which under the Gray mapping yield Hadamard matrices of order 2n (under the additional condition that an Hadamard matrix of order n exists). The constructed new codes in the Lee metric are often better in their parameters than previously known ones; in particular, they are essentially better than previously constructed Astola codes.- 1 July 2020
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 56 (3) , 245-252
Symmetric Block Designs and Optimal Equidistant Codes
We prove that any symmetric block design (v, k, λ) generates optimal ternary and quaternary constant-weight equidistant codes, whose parameters n, N, w, d, q are uniquely determined by the parameters of the block design. For one rather special case, we construct symbolwise uniform equidistant codes of the minimum length.
- 1 July 2020
- Published by Pleiades Publishing Ltd in Problems of Information Transmission
- Vol. 56 (3) , 245-252
Symmetric Block Designs and Optimal Equidistant Codes
We prove that any symmetric block design (v, k, λ) generates optimal ternary and quaternary constant-weight equidistant codes, whose parameters n, N, w, d, q are uniquely determined by the parameters of the block design. For one rather special case, we construct symbolwise uniform equidistant codes of the minimum length.
- 1 March 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (3) , 111732
On completely regular and completely transitive supplementary codes
- 1 March 2020
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (3) , 111732
On completely regular and completely transitive supplementary codes
- Open Access
On binary quadratic symmetric bent and almost bent functions
We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not of the Maiorana-McFarland type, but affine equivalent to it.
Open AccessOn binary quadratic symmetric bent and almost bent functions
We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not of the Maiorana-McFarland type, but affine equivalent to it.
- 18 March 2019
- Published by Springer Nature in Cryptography and Communications
- Vol. 11 (3) , 461-496
On classical Kloosterman sums
- 18 March 2019
- Published by Springer Nature in Cryptography and Communications
- Vol. 11 (3) , 461-496
On classical Kloosterman sums
- Open Access
- 12 January 2019
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 87 (2-3) , 183-184
Editorial: Special issue on coding and cryptography
- 12 January 2019
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 87 (2-3) , 183-184
Open AccessEditorial: Special issue on coding and cryptography