Lebedev Vladimir Sergeevich

Publications in Math-Net.Ru

1. Correcting a single error in an asymmetric feedback channel
   
   Probl. Peredachi Inf., 60:1 (2024),  26–32
2. Constructions of nonbinary codes meeting the Johnson bound
   
   Probl. Peredachi Inf., 60:1 (2024),  17–25
3. Correcting a single error in feedback channels
   
   Probl. Peredachi Inf., 58:4 (2022),  38–49
4. Improved upper bounds for the rate of separating and completely separating codes
   
   Probl. Peredachi Inf., 58:3 (2022),  45–57
5. Weakly resolvable block designs and nonbinary codes meeting the Johnson bound
   
   Probl. Peredachi Inf., 58:1 (2022),  3–15
6. Coding in a $\mathrm{Z}$-channel in case of many errors
   
   Probl. Peredachi Inf., 57:2 (2021),  36–43
7. Symmetric block designs and optimal equidistant codes
   
   Probl. Peredachi Inf., 56:3 (2020),  50–58
8. Search for a moving element with the minimum total cardinality of tests
   
   Probl. Peredachi Inf., 55:4 (2019),  107–111
9. On $m$-near-resolvable block designs and $q$-ary constant-weight codes
   
   Probl. Peredachi Inf., 54:3 (2018),  54–61
10. On metric dimension of nonbinary Hamming spaces
    
    Probl. Peredachi Inf., 54:1 (2018),  54–62
11. Adaptive search for one defective in the additive group testing model
    
    Probl. Peredachi Inf., 53:3 (2017),  78–83
12. Coding with noiseless feedback
    
    Probl. Peredachi Inf., 52:2 (2016),  3–14
13. Group testing problem with two defectives
    
    Probl. Peredachi Inf., 49:4 (2013),  87–94
14. Finding one of $D$ defective elements in some group testing models
    
    Probl. Peredachi Inf., 48:2 (2012),  100–109
15. Shadows under the word-subword relation
    
    Probl. Peredachi Inf., 48:1 (2012),  37–53
16. On enumeration of $q$-ary sequences with a fixed number of occurrences of the subblock 00
    
    Probl. Peredachi Inf., 46:4 (2010),  116–121
17. Separating codes and a new combinatorial search model
    
    Probl. Peredachi Inf., 46:1 (2010),  3–8
18. Asymptotic Bounds for the Rate of Colored Superimposed Codes
    
    Probl. Peredachi Inf., 44:2 (2008),  46–53
19. Remark on the Uniqueness of $(w,r)$-Cover-Pree Codes
    
    Probl. Peredachi Inf., 41:3 (2005),  17–22
20. On the Optimality of Trivial $(w,r)$ Cover-Free Codes
    
    Probl. Peredachi Inf., 40:3 (2004),  13–20
21. Asymptotic Upper Bound for the Rate of $(w,r)$ Cover-Free Codes
    
    Probl. Peredachi Inf., 39:4 (2003),  3–9
22. Correction of a Single Localized Error by Nonbinary Constant-Weight Codes of Weight One
    
    Probl. Peredachi Inf., 35:1 (1999),  38–43
23. Binary Constant-Weight Codes of Weight One Correcting Localized Errors
    
    Probl. Peredachi Inf., 34:3 (1998),  32–36
24. Difference Sets and Codes Correcting Single Localized Errors of Known Value
    
    Probl. Peredachi Inf., 32:2 (1996),  31–35
25. Construction of a Constant-Weight Code of Weight 2 Correcting One Localized Error
    
    Probl. Peredachi Inf., 31:2 (1995),  62–66
26. Constant-Weight Codes Correcting One Known Error
    
    Probl. Peredachi Inf., 30:4 (1994),  12–15
27. Minimax Estimation of Linear Functionals in the Presence of Two-Dimensional Noise
    
    Probl. Peredachi Inf., 26:1 (1990),  46–57