RUS  ENG
Full version
PEOPLE

Bassalygo Leonid Alexandrovich

Publications in Math-Net.Ru

  1. Constructions of nonbinary codes meeting the Johnson bound

    Probl. Peredachi Inf., 60:1 (2024),  17–25
  2. Weakly resolvable block designs and nonbinary codes meeting the Johnson bound

    Probl. Peredachi Inf., 58:1 (2022),  3–15
  3. Symmetric block designs and optimal equidistant codes

    Probl. Peredachi Inf., 56:3 (2020),  50–58
  4. Note on “Smaller explicit superconcentrators” by N. Alon and M. Capalbo

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

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

    Probl. Peredachi Inf., 53:1 (2017),  56–59
  7. One class of permutation polynomials over finite fields of even characteristic

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

    Probl. Peredachi Inf., 50:4 (2014),  15–21
  9. On the number of nonzero permanents over a finite field of odd characteristic

    Probl. Peredachi Inf., 49:4 (2013),  95–97
  10. Multiple-access hyperchannel

    Probl. Peredachi Inf., 49:4 (2013),  3–12
  11. Exact Values of the Sums of Multiplicative Characters of Polynomials over Finite Fields

    Mat. Zametki, 88:3 (2010),  340–349
  12. A model of restricted asynchronous multiple access in the presence of errors

    Probl. Peredachi Inf., 45:1 (2009),  41–50
  13. Polynomials of Special Form over a Finite Field with an Exact Value of the Trigonometric Sum

    Mat. Zametki, 82:1 (2007),  3–10
  14. The Gray–Rankin Bound for Nonbinary Codes

    Probl. Peredachi Inf., 42:3 (2006),  37–44
  15. On Polynomials of Special Form over a Finite Field of Odd Characteristic Attaining the Weil Bound

    Mat. Zametki, 78:1 (2005),  16–25
  16. Nonbinary Codes that Correct Errors in the Presence of One-Time Error-Free Feedback

    Probl. Peredachi Inf., 41:2 (2005),  63–67
  17. On Polynomials over a Finite Field of Even Characteristic with Maximum Absolute Value of the Trigonometric Sum

    Mat. Zametki, 72:2 (2002),  171–177
  18. Correction of Ordinary and Localized Errors

    Probl. Peredachi Inf., 37:4 (2001),  56–59
  19. Evaluation of the Asymptotics of the Summarized Capacity of an $M$-Frequency $T$-User Noiseless Multiple-Access Channel

    Probl. Peredachi Inf., 36:2 (2000),  3–9
  20. On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes

    Probl. Peredachi Inf., 35:2 (1999),  29–37
  21. Centered Error-Correcting Codes

    Probl. Peredachi Inf., 35:1 (1999),  30–37
  22. Polynomials of special form over a finite field with maximum modulus of the trigonometric sum

    Uspekhi Mat. Nauk, 52:2(314) (1997),  31–44
  23. Codes Detecting Localized Errors

    Probl. Peredachi Inf., 32:2 (1996),  36–38
  24. Authentication, Identification, and Pairwise Separated Measures

    Probl. Peredachi Inf., 32:1 (1996),  41–47
  25. Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors

    Probl. Peredachi Inf., 31:2 (1995),  76–83
  26. Estimate for the Maximal Number of Messages for a Given Probability of Successful Deception

    Probl. Peredachi Inf., 30:2 (1994),  42–48
  27. Binary Constant-Weight Codes Correcting Localized Errors and Defects

    Probl. Peredachi Inf., 30:2 (1994),  10–13
  28. Lower Bound on the Probability of Successful Substitution of Messages

    Probl. Peredachi Inf., 29:2 (1993),  104–108
  29. Binary Constant-Weight Codes Correcting Localized Errors

    Probl. Peredachi Inf., 28:4 (1992),  103–105
  30. Bounds for Codes with Separately Localized Errors

    Probl. Peredachi Inf., 28:1 (1992),  14–21
  31. Simple Methods for Deriving Lower Bounds in Coding Theory

    Probl. Peredachi Inf., 27:4 (1991),  3–8
  32. Controllable Connector

    Probl. Peredachi Inf., 26:2 (1990),  98–101
  33. A lower bound for complete trigonometric sums in terms of multiple sums

    Dokl. Akad. Nauk SSSR, 300:5 (1988),  1033–1036
  34. A Comment on the Paper of Kasami, Lin, Wei, and Yamamura, “Coding for the Binary Symmetric Broadcast Channel with Two Receivers”

    Probl. Peredachi Inf., 24:3 (1988),  102–106
  35. $\varepsilon$-Entropy of the Gibbs Field

    Probl. Peredachi Inf., 23:1 (1987),  3–15
  36. The unicity of a Gibbs field with random potential. An elementary approach

    Teor. Veroyatnost. i Primenen., 31:4 (1986),  651–670
  37. Some simple consequences of coding theory for combinatorial problems of packings and coverings

    Mat. Zametki, 34:2 (1983),  291–295
  38. Restricted Asynchronous Multiple Access

    Probl. Peredachi Inf., 19:4 (1983),  92–96
  39. Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information

    Probl. Peredachi Inf., 18:1 (1982),  3–11
  40. Bound on Admissible Transmission Rates in a Broadcast Channel with Errors in Both Components

    Probl. Peredachi Inf., 17:4 (1981),  19–28
  41. Asymptotically Optimal Switching Circuits

    Probl. Peredachi Inf., 17:3 (1981),  81–88
  42. Zero-Error Capacity of Continuous Memoryless Channels with a Small Input Signal

    Probl. Peredachi Inf., 17:1 (1981),  5–16
  43. Asymptotically Optimal Batch Rearrangeable and Nonrearrangeable Switching Circuits

    Probl. Peredachi Inf., 16:4 (1980),  94–98
  44. Bounds on Volume of Error-Correcting Codes in a Broadcast Channel (Generalized Blackwell Channel)

    Probl. Peredachi Inf., 16:3 (1980),  3–16
  45. Bounds for Codes with Unequal Protection of Two Sets of Messag

    Probl. Peredachi Inf., 15:3 (1979),  40–49
  46. Error correction in channels with defects

    Dokl. Akad. Nauk SSSR, 243:6 (1978),  1361–1364
  47. Note on Fast Multiplication of Polynomials over Galois Fields

    Probl. Peredachi Inf., 14:1 (1978),  101–102
  48. Remark on Uniformly Packed Codes

    Probl. Peredachi Inf., 13:3 (1977),  22–25
  49. Problems of Complexity in the Theory of Correcting Codes

    Probl. Peredachi Inf., 13:3 (1977),  5–17
  50. Formalization of the Problem of Complexity of Code Specification

    Probl. Peredachi Inf., 12:4 (1976),  105–106
  51. Nonexistence of Perfect Codes for Some Composite Alphabets

    Probl. Peredachi Inf., 11:3 (1975),  3–13
  52. A necessary condition for the existence of perfect codes in Lie metric

    Mat. Zametki, 15:2 (1974),  313–320
  53. Uniformly Packed Codes

    Probl. Peredachi Inf., 10:1 (1974),  9–14
  54. Complexity of an Optimum Nonblocking Switching Network without Reconnections

    Probl. Peredachi Inf., 9:1 (1973),  84–87
  55. Blocking Probability for a Rearrangeable Switching System

    Probl. Peredachi Inf., 6:4 (1970),  66–80
  56. Some Theorems on the Structures of Unspecialized Nonintersecting Connecting Systems

    Probl. Peredachi Inf., 5:2 (1969),  45–52
  57. Correcting Codes with an Additional Property

    Probl. Peredachi Inf., 4:1 (1968),  3–8
  58. On Separated Comma-Free Codes

    Probl. Peredachi Inf., 2:4 (1966),  78–79
  59. Uniform Convolutional Codes

    Probl. Peredachi Inf., 2:3 (1966),  97–99
  60. New Upper Bounds for Error Correcting Codes

    Probl. Peredachi Inf., 1:4 (1965),  41–44

  61. Retraction note: Note on “Smaller explicit superconcentrators” by N. Alon and M. Capalbo

    Probl. Peredachi Inf., 56:4 (2020),  109
  62. Mark Semenovich Pinsker. In Memoriam

    Probl. Peredachi Inf., 40:1 (2004),  3–5
  63. In Memory of Roland L'vovich Dobrushin

    Probl. Peredachi Inf., 32:3 (1996),  3–24
  64. Review of Scientific Achievements of M. S. Pinsker

    Probl. Peredachi Inf., 32:1 (1996),  5–19

© Steklov Math. Inst. of RAS, 2026