Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Bassalygo, Leonid Alexandrovich
Statistics Math-Net.Ru
Total publications: 64
Scientific articles: 60
Presentations: 8

Number of views:
This page:4537
Abstract pages:23334
Full texts:7973
References:1061
Doctor of physico-mathematical sciences
E-mail:

https://www.mathnet.ru/eng/person11180
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/195764

Publications in Math-Net.Ru Citations
2024
1. L. A. Bassalygo, V. A. Zinov'ev, V. S. Lebedev, “Constructions of nonbinary codes meeting the Johnson bound”, Probl. Peredachi Inf., 60:1 (2024),  17–25  mathnet
2022
2. L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Weakly resolvable block designs and nonbinary codes meeting the Johnson bound”, Probl. Peredachi Inf., 58:1 (2022),  3–15  mathnet; Problems Inform. Transmission, 58:1 (2022), 1–12  isi  scopus 3
2020
3. L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “Symmetric block designs and optimal equidistant codes”, Probl. Peredachi Inf., 56:3 (2020),  50–58  mathnet  elib; Problems Inform. Transmission, 56:3 (2020), 245–252  isi  scopus 3
2019
4. L. A. Bassalygo, “Note on “Smaller explicit superconcentrators” by N. Alon and M. Capalbo”, Probl. Peredachi Inf., 55:3 (2019),  106–108  mathnet  elib; Problems Inform. Transmission, 55:3 (2019), 295–297  isi  scopus 1
2018
5. L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “On $m$-near-resolvable block designs and $q$-ary constant-weight codes”, Probl. Peredachi Inf., 54:3 (2018),  54–61  mathnet  elib; Problems Inform. Transmission, 54:3 (2018), 245–252  isi  scopus 4
2017
6. L. A. Bassalygo, V. A. Zinoviev, “Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes”, Probl. Peredachi Inf., 53:1 (2017),  56–59  mathnet  elib; Problems Inform. Transmission, 53:1 (2017), 51–54  isi  scopus 10
2015
7. L. A. Bassalygo, V. A. Zinoviev, “One class of permutation polynomials over finite fields of even characteristic”, Mosc. Math. J., 15:4 (2015),  703–713  mathnet  mathscinet  isi 6
2014
8. L. A. Bassalygo, V. A. Zinoviev, “Optimal almost equisymbol codes based on difference matrices”, Probl. Peredachi Inf., 50:4 (2014),  15–21  mathnet  mathscinet; Problems Inform. Transmission, 50:4 (2014), 313–319  isi  scopus
2013
9. L. A. Bassalygo, “On the number of nonzero permanents over a finite field of odd characteristic”, Probl. Peredachi Inf., 49:4 (2013),  95–97  mathnet; Problems Inform. Transmission, 49:4 (2013), 382–383  isi  scopus 1
10. L. A. Bassalygo, V. V. Rykov, “Multiple-access hyperchannel”, Probl. Peredachi Inf., 49:4 (2013),  3–12  mathnet  elib; Problems Inform. Transmission, 49:4 (2013), 299–307  isi  scopus 13
2010
11. L. A. Bassalygo, V. A. Zinov'ev, “Exact Values of the Sums of Multiplicative Characters of Polynomials over Finite Fields”, Mat. Zametki, 88:3 (2010),  340–349  mathnet  mathscinet; Math. Notes, 88:3 (2010), 308–316  isi  scopus
2009
12. L. A. Bassalygo, “A model of restricted asynchronous multiple access in the presence of errors”, Probl. Peredachi Inf., 45:1 (2009),  41–50  mathnet  mathscinet  zmath; Problems Inform. Transmission, 45:1 (2009), 37–45  isi  scopus 6
2007
13. L. A. Bassalygo, V. A. Zinov'ev, “Polynomials of Special Form over a Finite Field with an Exact Value of the Trigonometric Sum”, Mat. Zametki, 82:1 (2007),  3–10  mathnet  mathscinet  elib; Math. Notes, 82:1 (2007), 3–9  isi  elib  scopus 1
2006
14. L. A. Bassalygo, S. M. Dodunekov, V. A. Zinov'ev, T. Helleseth, “The Gray–Rankin Bound for Nonbinary Codes”, Probl. Peredachi Inf., 42:3 (2006),  37–44  mathnet  mathscinet; Problems Inform. Transmission, 42:3 (2006), 197–203  scopus 7
2005
15. L. A. Bassalygo, V. A. Zinov'ev, “On Polynomials of Special Form over a Finite Field of Odd Characteristic Attaining the Weil Bound”, Mat. Zametki, 78:1 (2005),  16–25  mathnet  mathscinet  zmath  elib; Math. Notes, 78:1 (2005), 14–22  isi  elib  scopus
16. L. A. Bassalygo, “Nonbinary Codes that Correct Errors in the Presence of One-Time Error-Free Feedback”, Probl. Peredachi Inf., 41:2 (2005),  63–67  mathnet  mathscinet  zmath; Problems Inform. Transmission, 41:2 (2005), 125–129 18
2002
17. L. A. Bassalygo, V. A. Zinov'ev, “On Polynomials over a Finite Field of Even Characteristic with Maximum Absolute Value of the Trigonometric Sum”, Mat. Zametki, 72:2 (2002),  171–177  mathnet  mathscinet  zmath; Math. Notes, 72:2 (2002), 152–157  isi  scopus 2
2001
18. L. A. Bassalygo, M. S. Pinsker, “Correction of Ordinary and Localized Errors”, Probl. Peredachi Inf., 37:4 (2001),  56–59  mathnet  mathscinet  zmath; Problems Inform. Transmission, 37:4 (2001), 325–328 1
2000
19. L. A. Bassalygo, M. S. Pinsker, “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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:2 (2000), 91–97 10
1999
20. R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes”, Probl. Peredachi Inf., 35:2 (1999),  29–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:2 (1999), 117–124 5
21. L. A. Bassalygo, M. S. Pinsker, “Centered Error-Correcting Codes”, Probl. Peredachi Inf., 35:1 (1999),  30–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:1 (1999), 25–31 3
1997
22. L. A. Bassalygo, V. A. Zinov'ev, “Polynomials of special form over a finite field with maximum modulus of the trigonometric sum”, Uspekhi Mat. Nauk, 52:2(314) (1997),  31–44  mathnet  mathscinet  zmath; Russian Math. Surveys, 52:2 (1997), 271–284  isi  scopus 4
1996
23. L. A. Bassalygo, M. S. Pinsker, “Codes Detecting Localized Errors”, Probl. Peredachi Inf., 32:2 (1996),  36–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:2 (1996), 168–170 1
24. L. A. Bassalygo, M. V. Burnashev, “Authentication, Identification, and Pairwise Separated Measures”, Probl. Peredachi Inf., 32:1 (1996),  41–47  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:1 (1996), 33–39 7
1995
25. R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors”, Probl. Peredachi Inf., 31:2 (1995),  76–83  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:2 (1995), 162–168 1
1994
26. L. A. Bassalygo, M. V. Burnashev, “Estimate for the Maximal Number of Messages for a Given Probability of Successful Deception”, Probl. Peredachi Inf., 30:2 (1994),  42–48  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:2 (1994), 129–134 1
27. R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “Binary Constant-Weight Codes Correcting Localized Errors and Defects”, Probl. Peredachi Inf., 30:2 (1994),  10–13  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:2 (1994), 102–104 2
1993
28. L. A. Bassalygo, “Lower Bound on the Probability of Successful Substitution of Messages”, Probl. Peredachi Inf., 29:2 (1993),  104–108  mathnet  mathscinet  zmath; Problems Inform. Transmission, 29:2 (1993), 194–198
1992
29. L. A. Bassalygo, M. S. Pinsker, “Binary Constant-Weight Codes Correcting Localized Errors”, Probl. Peredachi Inf., 28:4 (1992),  103–105  mathnet  mathscinet  zmath; Problems Inform. Transmission, 28:4 (1992), 390–392 2
30. L. A. Bassalygo, S. I. Gel'fand, M. S. Pinsker, “Bounds for Codes with Separately Localized Errors”, Probl. Peredachi Inf., 28:1 (1992),  14–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 28:1 (1992), 11–17
1991
31. L. A. Bassalygo, S. I. Gel'fand, M. S. Pinsker, “Simple Methods for Deriving Lower Bounds in Coding Theory”, Probl. Peredachi Inf., 27:4 (1991),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 27:4 (1991), 277–281 5
1990
32. L. A. Bassalygo, M. S. Pinsker, “Controllable Connector”, Probl. Peredachi Inf., 26:2 (1990),  98–101  mathnet  mathscinet  zmath; Problems Inform. Transmission, 26:2 (1990), 170–172
1988
33. L. A. Bassalygo, V. A. Zinov'ev, S. N. Litsyn, “A lower bound for complete trigonometric sums in terms of multiple sums”, Dokl. Akad. Nauk SSSR, 300:5 (1988),  1033–1036  mathnet  mathscinet  zmath; Dokl. Math., 37:3 (1988), 756–759 2
34. L. A. Bassalygo, M. S. Pinsker, “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  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:3 (1988), 253–257 1
1987
35. L. A. Bassalygo, R. L. Dobrushin, “$\varepsilon$-Entropy of the Gibbs Field”, Probl. Peredachi Inf., 23:1 (1987),  3–15  mathnet  mathscinet  zmath; Problems Inform. Transmission, 23:1 (1987), 1–11 2
1986
36. L. A. Bassalygo, R. L. Dobrušin, “The unicity of a Gibbs field with random potential. An elementary approach”, Teor. Veroyatnost. i Primenen., 31:4 (1986),  651–670  mathnet  mathscinet  zmath; Theory Probab. Appl., 31:4 (1987), 572–589  isi 11
1983
37. L. A. Bassalygo, V. A. Zinov'ev, “Some simple consequences of coding theory for combinatorial problems of packings and coverings”, Mat. Zametki, 34:2 (1983),  291–295  mathnet  mathscinet  zmath; Math. Notes, 34:2 (1983), 629–631  isi
38. L. A. Bassalygo, M. S. Pinsker, “Restricted Asynchronous Multiple Access”, Probl. Peredachi Inf., 19:4 (1983),  92–96  mathnet  mathscinet  zmath 9
1982
39. L. A. Bassalygo, M. S. Pinsker, V. V. Prelov, “Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information”, Probl. Peredachi Inf., 18:1 (1982),  3–11  mathnet  zmath; Problems Inform. Transmission, 18:1 (1982), 1–8
1981
40. L. A. Bassalygo, “Bound on Admissible Transmission Rates in a Broadcast Channel with Errors in Both Components”, Probl. Peredachi Inf., 17:4 (1981),  19–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:4 (1981), 228–236
41. L. A. Bassalygo, “Asymptotically Optimal Switching Circuits”, Probl. Peredachi Inf., 17:3 (1981),  81–88  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:3 (1981), 206–211 4
42. L. A. Bassalygo, V. V. Prelov, “Zero-Error Capacity of Continuous Memoryless Channels with a Small Input Signal”, Probl. Peredachi Inf., 17:1 (1981),  5–16  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:1 (1981), 1–9
1980
43. L. A. Bassalygo, M. S. Pinsker, “Asymptotically Optimal Batch Rearrangeable and Nonrearrangeable Switching Circuits”, Probl. Peredachi Inf., 16:4 (1980),  94–98  mathnet  zmath
44. L. A. Bassalygo, M. S. Pinsker, “Bounds on Volume of Error-Correcting Codes in a Broadcast Channel (Generalized Blackwell Channel)”, Probl. Peredachi Inf., 16:3 (1980),  3–16  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:3 (1980), 163–174
1979
45. L. A. Bassalygo, V. A. Zinov'ev, V. V. Zyablov, M. S. Pinsker, G. Sh. Poltyrev, “Bounds for Codes with Unequal Protection of Two Sets of Messag”, Probl. Peredachi Inf., 15:3 (1979),  40–49  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:3 (1979), 190–197 2
1978
46. L. A. Bassalygo, M. S. Pinsker, “Error correction in channels with defects”, Dokl. Akad. Nauk SSSR, 243:6 (1978),  1361–1364  mathnet  mathscinet  zmath 1
47. L. A. Bassalygo, “Note on Fast Multiplication of Polynomials over Galois Fields”, Probl. Peredachi Inf., 14:1 (1978),  101–102  mathnet  mathscinet  zmath; Problems Inform. Transmission, 14:1 (1978), 71–72
1977
48. L. A. Bassalygo, V. A. Zinov'ev, “Remark on Uniformly Packed Codes”, Probl. Peredachi Inf., 13:3 (1977),  22–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 13:3 (1977), 178–180 13
49. L. A. Bassalygo, V. V. Zyablov, M. S. Pinsker, “Problems of Complexity in the Theory of Correcting Codes”, Probl. Peredachi Inf., 13:3 (1977),  5–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 13:3 (1977), 166–175
1976
50. L. A. Bassalygo, “Formalization of the Problem of Complexity of Code Specification”, Probl. Peredachi Inf., 12:4 (1976),  105–106  mathnet  mathscinet  zmath; Problems Inform. Transmission, 12:4 (1976), 322–324 3
1975
51. L. A. Bassalygo, V. A. Zinov'ev, V. K. Leont'ev, N. I. Fel'dman, “Nonexistence of Perfect Codes for Some Composite Alphabets”, Probl. Peredachi Inf., 11:3 (1975),  3–13  mathnet  mathscinet  zmath; Problems Inform. Transmission, 11:3 (1975), 181–189 2
1974
52. L. A. Bassalygo, “A necessary condition for the existence of perfect codes in Lie metric”, Mat. Zametki, 15:2 (1974),  313–320  mathnet  mathscinet  zmath; Math. Notes, 15:2 (1974), 178–181 4
53. L. A. Bassalygo, G. V. Zaitsev, V. A. Zinov'ev, “Uniformly Packed Codes”, Probl. Peredachi Inf., 10:1 (1974),  9–14  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:1 (1974), 6–9 16
1973
54. L. A. Bassalygo, M. S. Pinsker, “Complexity of an Optimum Nonblocking Switching Network without Reconnections”, Probl. Peredachi Inf., 9:1 (1973),  84–87  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:1 (1973), 64–66 3
1970
55. L. A. Bassalygo, B. S. Tsybakov, “Blocking Probability for a Rearrangeable Switching System”, Probl. Peredachi Inf., 6:4 (1970),  66–80  mathnet  mathscinet; Problems Inform. Transmission, 6:4 (1970), 336–348
1969
56. L. A. Bassalygo, I. I. Grushko, V. I. Neiman, “Some Theorems on the Structures of Unspecialized Nonintersecting Connecting Systems”, Probl. Peredachi Inf., 5:2 (1969),  45–52  mathnet  mathscinet; Problems Inform. Transmission, 5:2 (1969), 34–39 1
1968
57. L. A. Bassalygo, “Correcting Codes with an Additional Property”, Probl. Peredachi Inf., 4:1 (1968),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 4:1 (1968), 1–5
1966
58. L. A. Bassalygo, “On Separated Comma-Free Codes”, Probl. Peredachi Inf., 2:4 (1966),  78–79  mathnet  zmath; Problems Inform. Transmission, 2:4 (1966), 52–53
59. L. A. Bassalygo, “Uniform Convolutional Codes”, Probl. Peredachi Inf., 2:3 (1966),  97–99  mathnet  zmath; Problems Inform. Transmission, 2:3 (1966), 80–82
1965
60. L. A. Bassalygo, “New Upper Bounds for Error Correcting Codes”, Probl. Peredachi Inf., 1:4 (1965),  41–44  mathnet  mathscinet  zmath; Problems Inform. Transmission, 1:4 (1965), 32–35 17
2020
61. L. A. Bassalygo, “Retraction note: Note on “Smaller explicit superconcentrators” by N. Alon and M. Capalbo”, Probl. Peredachi Inf., 56:4 (2020),  109  mathnet; Problems Inform. Transmission, 56:4 (2020), 399  isi
2004
62. A. M. Barg, L. A. Bassalygo, V. M. Blinovskii, M. V. Burnashev, N. D. Vvedenskaya, G. K. Golubev, I. I. Dumer, K. Sh. Zigangirov, V. V. Zyablov, V. A. Zinov'ev, G. A. Kabatiansky, V. D. Kolesnik, N. A. Kuznetsov, V. A. Malyshev, R. A. Minlos, D. Yu. Nogin, I. A. Ovseevich, V. V. Prelov, Yu. L. Sagalovich, V. M. Tikhomirov, R. Z. Khas'minskii, B. S. Tsybakov, “Mark Semenovich Pinsker. In Memoriam”, Probl. Peredachi Inf., 40:1 (2004),  3–5  mathnet  mathscinet; Problems Inform. Transmission, 40:1 (2004), 1–4 2
1996
63. L. A. Bassalygo, V. A. Malyshev, R. A. Minlos, I. A. Ovseevich, E. A. Pechersky, M. S. Pinsker, V. V. Prelov, A. N. Rybko, Yu. M. Sukhov, S. B. Shlosman, “In Memory of Roland L'vovich Dobrushin”, Probl. Peredachi Inf., 32:3 (1996),  3–24  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:3 (1996), 223–238 4
64. L. A. Bassalygo, S. I. Gel'fand, G. K. Golubev, R. L. Dobrushin, V. V. Prelov, Ya. G. Sinai, R. Z. Khas'minskii, A. M. Yaglom, “Review of Scientific Achievements of M. S. Pinsker”, Probl. Peredachi Inf., 32:1 (1996),  5–19  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:1 (1996), 3–14 1

Presentations in Math-Net.Ru
1. Концентратор Пинскера
L. A. Bassalygo
Seminar on Coding Theory
April 5, 2016 19:00
2. Локализованные ошибки ("техническая" сторона доказательств)
L. A. Bassalygo
Seminar on Coding Theory
November 3, 2015 19:00
3. Границы для кодов, исправляющих пачки ошибок
L. A. Bassalygo
Seminar on Coding Theory
March 31, 2015 19:00
4. Перестановочные многочлены над конечными полями
L. A. Bassalygo
Seminar on Coding Theory
November 18, 2014 19:00
5. Оптимальные почти равносимвольные коды
L. A. Bassalygo
Seminar on Coding Theory
December 17, 2013 19:00
6. About Number of Nonzero Permanents under Odd Characteristics` Field
L. A. Bassalygo
Seminar on Coding Theory
April 16, 2013 19:00
7. Conference in Honour of Robert Minlos' 80th Birthday
G. I. Olshanski, A. A. Vladimirov, S. B. Shlosman, V. A. Malyshev, B. M. Gurevich, M. L. Blank, G. A. Kabatiansky, L. A. Bassalygo, N. D. Vvedenskaya, A. M. Vershik
Dobrushin Mathematics Laboratory Seminar
March 1, 2011 12:30
8. Codes with one restricted distance
L. A. Bassalygo
Seminar on Coding Theory
November 30, 2010 19:00

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024