Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Lebedev, Vladimir Sergeevich
Statistics Math-Net.Ru
Total publications: 27
Scientific articles: 27
Presentations: 8

Number of views:
This page:762
Abstract pages:6939
Full texts:1967
References:895
E-mail: ,

https://www.mathnet.ru/eng/person34778
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru Citations
2024
1. I. V. Vorob'ev, A. V. Lebedev, V. S. Lebedev, “Correcting a single error in an asymmetric feedback channel”, Probl. Peredachi Inf., 60:1 (2024),  26–32  mathnet
2. 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
3. I. V. Vorob'ev, Ch. Deppe, A. V. Lebedev, V. S. Lebedev, “Correcting a single error in feedback channels”, Probl. Peredachi Inf., 58:4 (2022),  38–49  mathnet 1
4. I. V. Vorob'ev, V. S. Lebedev, “Improved upper bounds for the rate of separating and completely separating codes”, Probl. Peredachi Inf., 58:3 (2022),  45–57  mathnet
5. 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
2021
6. V. S. Lebedev, N. A. Polyanskii, “Coding in a $\mathrm{Z}$-channel in case of many errors”, Probl. Peredachi Inf., 57:2 (2021),  36–43  mathnet; Problems Inform. Transmission, 57:2 (2021), 129–135  isi  scopus
2020
7. 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
8. A. V. Lebedev, V. S. Lebedev, “Search for a moving element with the minimum total cardinality of tests”, Probl. Peredachi Inf., 55:4 (2019),  107–111  mathnet  elib; Problems Inform. Transmission, 55:4 (2019), 396–400  isi  scopus 1
2018
9. 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
10. G. A. Kabatiansky, V. S. Lebedev, “On metric dimension of nonbinary Hamming spaces”, Probl. Peredachi Inf., 54:1 (2018),  54–62  mathnet  elib; Problems Inform. Transmission, 54:1 (2018), 48–55  isi  scopus 4
2017
11. V. S. Lebedev, “Adaptive search for one defective in the additive group testing model”, Probl. Peredachi Inf., 53:3 (2017),  78–83  mathnet  elib; Problems Inform. Transmission, 53:3 (2017), 274–278  isi  scopus
2016
12. V. S. Lebedev, “Coding with noiseless feedback”, Probl. Peredachi Inf., 52:2 (2016),  3–14  mathnet  mathscinet  elib; Problems Inform. Transmission, 52:2 (2016), 103–113  isi  elib  scopus 11
2013
13. C. Deppe, V. S. Lebedev, “Group testing problem with two defectives”, Probl. Peredachi Inf., 49:4 (2013),  87–94  mathnet; Problems Inform. Transmission, 49:4 (2013), 375–381  isi  scopus 2
2012
14. R. Ahlswede, C. Deppe, V. S. Lebedev, “Finding one of $D$ defective elements in some group testing models”, Probl. Peredachi Inf., 48:2 (2012),  100–109  mathnet; Problems Inform. Transmission, 48:2 (2012), 173–181  isi  scopus 6
15. R. Ahlswede, V. S. Lebedev, “Shadows under the word-subword relation”, Probl. Peredachi Inf., 48:1 (2012),  37–53  mathnet; Problems Inform. Transmission, 48:1 (2012), 31–46  isi  scopus 1
2010
16. V. S. Lebedev, “On enumeration of $q$-ary sequences with a fixed number of occurrences of the subblock 00”, Probl. Peredachi Inf., 46:4 (2010),  116–121  mathnet  mathscinet; Problems Inform. Transmission, 46:4 (2010), 376–381  isi  scopus
17. V. S. Lebedev, “Separating codes and a new combinatorial search model”, Probl. Peredachi Inf., 46:1 (2010),  3–8  mathnet  mathscinet; Problems Inform. Transmission, 46:1 (2010), 1–6  isi  scopus 8
2008
18. V. S. Lebedev, “Asymptotic Bounds for the Rate of Colored Superimposed Codes”, Probl. Peredachi Inf., 44:2 (2008),  46–53  mathnet  mathscinet; Problems Inform. Transmission, 44:1 (2008), 112–118  isi  scopus
2005
19. V. S. Lebedev, “Remark on the Uniqueness of $(w,r)$-Cover-Pree Codes”, Probl. Peredachi Inf., 41:3 (2005),  17–22  mathnet  mathscinet  zmath; Problems Inform. Transmission, 41:3 (2005), 199–203 1
2004
20. H. K. Kim, V. S. Lebedev, “On the Optimality of Trivial $(w,r)$ Cover-Free Codes”, Probl. Peredachi Inf., 40:3 (2004),  13–20  mathnet  mathscinet  zmath; Problems Inform. Transmission, 40:3 (2004), 195–201 4
2003
21. V. S. Lebedev, “Asymptotic Upper Bound for the Rate of $(w,r)$ Cover-Free Codes”, Probl. Peredachi Inf., 39:4 (2003),  3–9  mathnet  mathscinet  zmath; Problems Inform. Transmission, 39:4 (2003), 317–323 18
1999
22. V. S. Lebedev, “Correction of a Single Localized Error by Nonbinary Constant-Weight Codes of Weight One”, Probl. Peredachi Inf., 35:1 (1999),  38–43  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:1 (1999), 32–36
1998
23. V. S. Lebedev, “Binary Constant-Weight Codes of Weight One Correcting Localized Errors”, Probl. Peredachi Inf., 34:3 (1998),  32–36  mathnet  mathscinet  zmath; Problems Inform. Transmission, 34:3 (1998), 233–237
1996
24. G. A. Kabatiansky, V. S. Lebedev, “Difference Sets and Codes Correcting Single Localized Errors of Known Value”, Probl. Peredachi Inf., 32:2 (1996),  31–35  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:2 (1996), 164–167
1995
25. V. S. Lebedev, “Construction of a Constant-Weight Code of Weight 2 Correcting One Localized Error”, Probl. Peredachi Inf., 31:2 (1995),  62–66  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:2 (1995), 150–153 1
1994
26. V. S. Lebedev, “Constant-Weight Codes Correcting One Known Error”, Probl. Peredachi Inf., 30:4 (1994),  12–15  mathnet  mathscinet  zmath; Problems Inform. Transmission, 39:4 (1994), 299–302 1
1990
27. V. S. Lebedev, “Minimax Estimation of Linear Functionals in the Presence of Two-Dimensional Noise”, Probl. Peredachi Inf., 26:1 (1990),  46–57  mathnet  mathscinet  zmath; Problems Inform. Transmission, 26:1 (1990), 38–48

Presentations in Math-Net.Ru
1. Кодирование при наличии бесшумной обратной связи
V. S. Lebedev
Seminar on Coding Theory
April 4, 2017 19:00
2. Поиск со лжецом или кодирование при наличии бесшумной обратной связи
V. S. Lebedev
Dobrushin Mathematics Laboratory Seminar
April 4, 2017 16:00
3. О метрической размерности недвоичных пространств Хэмминга
G. A. Kabatiansky, V. S. Lebedev
Seminar on Coding Theory
January 17, 2017 19:00
4. Жесткость пространства Хэмминга
V. S. Lebedev
Seminar on Coding Theory
November 24, 2015 19:00
5. Кодирование при наличии бесшумной обратной связи
V. S. Lebedev
Seminar on Coding Theory
March 10, 2015 19:00
6. Алгоритм кодирования для канала с полной обратной связью (задача Улама)
V. S. Lebedev
Seminar on Coding Theory
April 1, 2014 19:00
7. About Combinatorial Search of Active Objects
V. S. Lebedev
Seminar on Coding Theory
October 1, 2013 19:00
8. Group Testing With Two Defective Elements
V. S. Lebedev
Seminar on Coding Theory
November 27, 2012 19:00

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