RUS  ENG
Full version
PEOPLE

Zinov'ev Victor Alexandrovich

Publications in Math-Net.Ru

  1. Constructions of nonbinary codes meeting the Johnson bound

    Probl. Peredachi Inf., 60:1 (2024),  17–25
  2. On binary quadratic symmetric bent and semi-bent functions

    Mosc. Math. J., 23:1 (2023),  121–128
  3. On the classification of completely regular codes with covering radius two and antipodal duals

    Probl. Peredachi Inf., 59:3 (2023),  26–39
  4. On codes with distances $d$ and $n$

    Probl. Peredachi Inf., 58:4 (2022),  62–83
  5. On one construction method for Hadamard matrices

    Probl. Peredachi Inf., 58:4 (2022),  13–37
  6. Weakly resolvable block designs and nonbinary codes meeting the Johnson bound

    Probl. Peredachi Inf., 58:1 (2022),  3–15
  7. On the generalized concatenated construction for the Nordstrom–Robinson code and the binary Golay code

    Probl. Peredachi Inf., 57:4 (2021),  34–44
  8. On the generalized concatenated construction for codes in $L_1$ and Lee metrics

    Probl. Peredachi Inf., 57:1 (2021),  81–95
  9. Symmetric block designs and optimal equidistant codes

    Probl. Peredachi Inf., 56:3 (2020),  50–58
  10. On $q$-ary codes with two distances $d$ and $d+1$

    Probl. Peredachi Inf., 56:1 (2020),  38–50
  11. On completely regular codes

    Probl. Peredachi Inf., 55:1 (2019),  3–50
  12. On $m$-near-resolvable block designs and $q$-ary constant-weight codes

    Probl. Peredachi Inf., 54:3 (2018),  54–61
  13. Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes

    Probl. Peredachi Inf., 53:1 (2017),  56–59
  14. Generalized Preparata codes and $2$-resolvable Steiner quadruple systems

    Probl. Peredachi Inf., 52:2 (2016),  15–36
  15. One class of permutation polynomials over finite fields of even characteristic

    Mosc. Math. J., 15:4 (2015),  703–713
  16. Optimal almost equisymbol codes based on difference matrices

    Probl. Peredachi Inf., 50:4 (2014),  15–21
  17. Non-full-rank Steiner quadruple systems $S(v,4,3)$

    Probl. Peredachi Inf., 50:3 (2014),  76–86
  18. Structure of Steiner triple systems $S(2^m-1,3,2)$ of rank $2^m-m+2$ over $\mathbb F_2$

    Probl. Peredachi Inf., 49:3 (2013),  40–56
  19. Steiner triple systems $S(2^m-1,3,2)$ of rank $2^m-m+1$ over $\mathbb F_2$

    Probl. Peredachi Inf., 48:2 (2012),  21–47
  20. Steiner systems $S(v,k,k-1)$: components and rank

    Probl. Peredachi Inf., 47:2 (2011),  52–71
  21. Exact Values of the Sums of Multiplicative Characters of Polynomials over Finite Fields

    Mat. Zametki, 88:3 (2010),  340–349
  22. Binary perfect and extended perfect codes of lengths 15 and 16 with ranks 13 and 14

    Probl. Peredachi Inf., 46:1 (2010),  20–24
  23. On one transformation of Steiner quadruple systems $S(v,4,3)$

    Probl. Peredachi Inf., 45:4 (2009),  26–42
  24. Fourier-invariant pairs of partitions of finite abelian groups and association schemes

    Probl. Peredachi Inf., 45:3 (2009),  33–44
  25. Polynomials of Special Form over a Finite Field with an Exact Value of the Trigonometric Sum

    Mat. Zametki, 82:1 (2007),  3–10
  26. On the Construction of $q$-ary Equidistant Codes

    Probl. Peredachi Inf., 43:4 (2007),  13–36
  27. On New Completely Regular $q$-ary Codes

    Probl. Peredachi Inf., 43:2 (2007),  34–51
  28. On Resolvability of Steiner Systems $S(v=2^m,4,3)$ of Rank $r\le v-m+1$ over $\mathbb F_2$

    Probl. Peredachi Inf., 43:1 (2007),  39–55
  29. Classification of Steiner Quadruple Systems of Order 16 and of Rank 14

    Probl. Peredachi Inf., 42:3 (2006),  59–72
  30. The Gray–Rankin Bound for Nonbinary Codes

    Probl. Peredachi Inf., 42:3 (2006),  37–44
  31. Binary Extended Perfect Codes of Length 16 and Rank 14

    Probl. Peredachi Inf., 42:2 (2006),  63–80
  32. Vasil'ev Codes of Length $n=2^m$ and Doubling of Steiner Systems $S(n,4,3)$ of a Given Rank

    Probl. Peredachi Inf., 42:1 (2006),  13–33
  33. On Polynomials of Special Form over a Finite Field of Odd Characteristic Attaining the Weil Bound

    Mat. Zametki, 78:1 (2005),  16–25
  34. On Cosets of Weight 4 of Binary BCH Codes with Minimum Distance 8 and Exponential Sums

    Probl. Peredachi Inf., 41:4 (2005),  36–56
  35. Classification of Steiner Quadruple Systems of Order 16 and of Rank at Most 13

    Probl. Peredachi Inf., 40:4 (2004),  48–67
  36. On Weight Distributions of Cosets of Goethals-Like Codes

    Probl. Peredachi Inf., 40:2 (2004),  19–36
  37. Binary Perfect Codes of Length 15 by Generalized Concatenated Construction

    Probl. Peredachi Inf., 40:1 (2004),  27–39
  38. On Polynomials over a Finite Field of Even Characteristic with Maximum Absolute Value of the Trigonometric Sum

    Mat. Zametki, 72:2 (2002),  171–177
  39. Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction

    Probl. Peredachi Inf., 38:4 (2002),  56–84
  40. On Generalized Concatenated Constructions of Perfect Binary Nonlinear Codes

    Probl. Peredachi Inf., 36:4 (2000),  59–73
  41. On Algebraic Decoding of Some Maximal Quaternary Codes and the Binary Golay Code

    Probl. Peredachi Inf., 35:4 (1999),  59–67
  42. New Lower Bounds for Contact Numbers in Small Dimensions

    Probl. Peredachi Inf., 35:4 (1999),  3–11
  43. On Binary Cyclic Codes with Minimum Distance $d=3$

    Probl. Peredachi Inf., 33:4 (1997),  3–14
  44. Polynomials of special form over a finite field with maximum modulus of the trigonometric sum

    Uspekhi Mat. Nauk, 52:2(314) (1997),  31–44
  45. On Fourier-Invariant Partitions of Finite Abelian Groups and the MacWilliams Identity for Group Codes

    Probl. Peredachi Inf., 32:1 (1996),  137–143
  46. Universal Code Families

    Probl. Peredachi Inf., 29:2 (1993),  3–8
  47. New Packings on a Finite-Dimensional Euclidean Sphere

    Probl. Peredachi Inf., 28:2 (1992),  47–53
  48. Concatenation Method for Construction of Spherical Codes in $n$-Dimensional Euclidean Space

    Probl. Peredachi Inf., 27:4 (1991),  34–38
  49. Concatenated Codes in Euclidean Space

    Probl. Peredachi Inf., 25:3 (1989),  62–75
  50. A lower bound for complete trigonometric sums in terms of multiple sums

    Dokl. Akad. Nauk SSSR, 300:5 (1988),  1033–1036
  51. Lower bounds for complete rational trigonometric sums

    Uspekhi Mat. Nauk, 43:1(259) (1988),  199–200
  52. On the General Code Shortening Construction

    Probl. Peredachi Inf., 23:2 (1987),  28–34
  53. On Concatenated Constant-Weight Codes Beyond the Varshamov–Gilbert Bound

    Probl. Peredachi Inf., 23:1 (1987),  110–111
  54. On the Dual Distance of BCH Codes

    Probl. Peredachi Inf., 22:4 (1986),  29–34
  55. On Codes Beyond the Gilbert Bound

    Probl. Peredachi Inf., 21:1 (1985),  109–111
  56. On a Generalization of the Johnson Bound for Constant-Weight Codes

    Probl. Peredachi Inf., 20:3 (1984),  105–108
  57. On Shortening of Codes

    Probl. Peredachi Inf., 20:1 (1984),  3–11
  58. Some simple consequences of coding theory for combinatorial problems of packings and coverings

    Mat. Zametki, 34:2 (1983),  291–295
  59. Minimum-Check-Density Codes for Correcting Bytes of Errors, Erasures, or Defects

    Probl. Peredachi Inf., 19:3 (1983),  29–37
  60. On Methods of Code Lengthening

    Probl. Peredachi Inf., 18:4 (1982),  29–42
  61. Generalized Concatenated Codes for Channels with Error Bursts and Independent Errors

    Probl. Peredachi Inf., 17:4 (1981),  53–62
  62. Codes with Unequal Protection of Information Symbols

    Probl. Peredachi Inf., 15:3 (1979),  50–60
  63. Bounds for Codes with Unequal Protection of Two Sets of Messag

    Probl. Peredachi Inf., 15:3 (1979),  40–49
  64. Correction of Error Bursts and Independent Errors using Generalized Concatenated Codes

    Probl. Peredachi Inf., 15:2 (1979),  58–70
  65. Some New Maximal Codes over $GF(4)$

    Probl. Peredachi Inf., 14:3 (1978),  24–34
  66. Decoding of Nonlinear Generalized Concatenated Codes

    Probl. Peredachi Inf., 14:2 (1978),  46–52
  67. Remark on Uniformly Packed Codes

    Probl. Peredachi Inf., 13:3 (1977),  22–25
  68. Algebraic theory of block codes detecting independent

    Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 13 (1976),  189–234
  69. Generalized Cascade Codes

    Probl. Peredachi Inf., 12:1 (1976),  5–15
  70. Nonexistence of Perfect Codes for Some Composite Alphabets

    Probl. Peredachi Inf., 11:3 (1975),  3–13
  71. Uniformly Packed Codes

    Probl. Peredachi Inf., 10:1 (1974),  9–14
  72. On Perfect Codes

    Probl. Peredachi Inf., 8:1 (1972),  26–35
  73. Uniformly Packed Codes

    Probl. Peredachi Inf., 7:1 (1971),  38–50
  74. Balanced Codes and Tactical Configurations

    Probl. Peredachi Inf., 5:3 (1969),  28–36
  75. A Class of Maximum Equidistant Codes

    Probl. Peredachi Inf., 5:2 (1969),  84–87
  76. Complete and Quasi-complete Balanced Codes

    Probl. Peredachi Inf., 5:2 (1969),  14–18
  77. Equidistant $q$-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs

    Probl. Peredachi Inf., 4:2 (1968),  3–10

  78. Erratum to: “On completely regular codes” [Problemy Peredachi Informatsii 55, no. 1, 3–50 (2019)]

    Probl. Peredachi Inf., 55:3 (2019),  109
  79. Remark on "Steiner triple systems $S(2^m-1,3,2)$ of rank $2^m-m+1$ over $\mathbb F_2$" published in Probl. Peredachi Inf., 2012, no. 2

    Probl. Peredachi Inf., 49:2 (2013),  107–111
  80. Mark Semenovich Pinsker. In Memoriam

    Probl. Peredachi Inf., 40:1 (2004),  3–5

© Steklov Math. Inst. of RAS, 2024