default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir S. Lebedev
Person information
- affiliation: Russian Academy of Sciences, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
Constructions of Nonbinary Codes Meeting the Johnson Bound. Probl. Inf. Transm. 60(1): 12-20 (2024)- [j26]Ilya V. Vorobyev, Alexey V. Lebedev, Vladimir S. Lebedev:
Correcting a Single Error in an Asymmetric Feedback Channel. Probl. Inf. Transm. 60(1): 21-27 (2024) - 2023
- [c12]Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev:
Correcting One Error in Non-Binary Channels with Feedback. ISIT 2023: 1266-1270 - [i10]Ilya Vorobyev, Alexey S. Lebedev, Vladimir S. Lebedev, Christian Deppe:
Correcting one error in channels with feedback. CoRR abs/2301.01848 (2023) - [i9]Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev:
Correcting One Error in Non-Binary Channels with Feedback. CoRR abs/2305.06691 (2023) - 2022
- [j25]Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound. Probl. Inf. Transm. 58(1): 1-12 (2022) - [j24]Ilya V. Vorob'ev, Vladimir S. Lebedev:
Improved Upper Bounds for the Rate of Separating and Completely Separating Codes. Probl. Inf. Transm. 58(3): 242-253 (2022) - [j23]Ilya V. Vorobyev, Christian Deppe, Alexey V. Lebedev, Vladimir S. Lebedev:
Correcting a Single Error in Feedback Channels. Probl. Inf. Transm. 58(4): 329-340 (2022) - [j22]Alexey V. Lebedev
, Vladimir S. Lebedev, Nikita Polyanskii:
Two-Stage Coding Over the Z-Channel. IEEE Trans. Inf. Theory 68(4): 2290-2299 (2022) - [j21]Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding With Noiseless Feedback Over the Z-Channel. IEEE Trans. Inf. Theory 68(6): 3731-3739 (2022) - [i8]Alexey V. Lebedev, Ilya Vorobyev, Vladimir S. Lebedev, Christian Deppe:
Non-adaptive and two-stage coding over the Z-channel. CoRR abs/2202.00136 (2022) - 2021
- [j20]Christian Deppe, Vladimir S. Lebedev:
Algorithms for q-ary error-correcting codes with limited magnitude and feedback. Discret. Math. 344(2): 112199 (2021) - [j19]Vladimir S. Lebedev, N. A. Polyanskii:
Coding in a Z-Channel in Case of Many Errors. Probl. Inf. Transm. 57(2): 129-135 (2021) - [j18]Christian Deppe, Vladimir S. Lebedev, Georg Maringer:
Bounds for the capacity error function for unidirectional channels with noiseless feedback. Theor. Comput. Sci. 856: 1-13 (2021) - 2020
- [j17]Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
Symmetric Block Designs and Optimal Equidistant Codes. Probl. Inf. Transm. 56(3): 245-252 (2020) - [c11]Christian Deppe, Georg Maringer, Vladimir S. Lebedev:
How to apply the rubber method for channels with feedback. ACCT 2020: 1-6 - [c10]Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding with Noiseless Feedback over the Z-Channel. COCOON 2020: 98-109 - [c9]Christian Deppe, Georg Maringer, Vladimir S. Lebedev:
Bounds for the capacity error function for unidirectional channels with noiseless feedback. ISIT 2020: 2061-2066 - [i7]Christian Deppe, Vladimir S. Lebedev, Georg Maringer:
Bounds for the capacity error function for unidirectional channels with noiseless feedback. CoRR abs/2001.09030 (2020) - [i6]Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii:
Coding with Noiseless Feedback over the Z-channel. CoRR abs/2007.04026 (2020) - [i5]Christian Deppe, Vladimir S. Lebedev, Georg Maringer:
How to apply the rubber method for channels with feedback. CoRR abs/2007.10265 (2020) - [i4]Christian Deppe, Vladimir S. Lebedev:
Algorithms for q-ary Error-Correcting Codes with Limited Magnitude and Feedback. CoRR abs/2010.14257 (2020) - [i3]Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii:
Two-stage coding over the Z-channel. CoRR abs/2010.16362 (2020)
2010 – 2019
- 2019
- [j16]Alexey V. Lebedev, Vladimir S. Lebedev:
Search for a Moving Element with the Minimum Total Cardinality of Tests. Probl. Inf. Transm. 55(4): 396-400 (2019) - [c8]Christian Deppe, Vladimir S. Lebedev:
Algorithms for Q-ary Error-Correcting Codes with Partial Feedback and Limited Magnitude. ISIT 2019: 2244-2248 - 2018
- [j15]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. Int. J. Found. Comput. Sci. 29(4): 481-504 (2018) - [j14]Gregory A. Kabatiansky, Vladimir S. Lebedev:
On Metric Dimension of Nonbinary Hamming Spaces. Probl. Inf. Transm. 54(1): 48-55 (2018) - [j13]Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev:
On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes. Probl. Inf. Transm. 54(3): 245-252 (2018) - 2017
- [j12]Vladimir Gritsenko, Grigory Kabatiansky, Vladimir S. Lebedev, Alexey Maevskiy:
Signature codes for noisy multiple access adder channel. Des. Codes Cryptogr. 82(1-2): 293-299 (2017) - [j11]Vladimir S. Lebedev:
Adaptive search for one defective in the additive group testing model. Probl. Inf. Transm. 53(3): 274-278 (2017) - 2016
- [j10]Vladimir S. Lebedev:
Coding with noiseless feedback. Probl. Inf. Transm. 52(2): 103-113 (2016) - [c7]Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. SOFSEM 2016: 148-160 - 2014
- [i2]Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev:
Superimposed Codes and Threshold Group Testing. CoRR abs/1401.7485 (2014) - 2013
- [j9]Christian Deppe, Vladimir S. Lebedev:
Group testing problem with two defectives. Probl. Inf. Transm. 49(4): 375-381 (2013) - [c6]Rudolf Ahlswede, Vladimir S. Lebedev:
The Restricted Word Shadow Problem. Information Theory, Combinatorics, and Search Theory 2013: 364-370 - [c5]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 488-508 - [c4]Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev:
Superimposed Codes and Threshold Group Testing. Information Theory, Combinatorics, and Search Theory 2013: 509-533 - 2012
- [j8]Rudolf Ahlswede, Vladimir S. Lebedev:
Shadows under the word-subword relation. Probl. Inf. Transm. 48(1): 31-46 (2012) - [j7]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Finding one of D defective elements in some group testing models. Probl. Inf. Transm. 48(2): 173-181 (2012) - 2011
- [c3]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Bounds for threshold and majority group testing. ISIT 2011: 69-73 - [c2]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Majority group testing with density tests. ISIT 2011: 326-330 - 2010
- [j6]Vladimir S. Lebedev:
Separating codes and a new combinatorial search model. Probl. Inf. Transm. 46(1): 1-6 (2010) - [j5]Vladimir S. Lebedev:
On enumeration of q-ary sequences with a fixed number of occurrences of the subblock 00. Probl. Inf. Transm. 46(4): 376-381 (2010)
2000 – 2009
- 2008
- [j4]Vladimir S. Lebedev:
Asymptotic bounds for the rate of colored superimposed codes. Probl. Inf. Transm. 44(2): 112-118 (2008) - 2006
- [c1]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Non-binary error correcting codes with noiseless feedback, localized errors, or both. ISIT 2006: 2486-2487 - [i1]Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Non--binary error correcting codes with noiseless feedback, localized errors, or both. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - 2005
- [j3]Vladimir S. Lebedev:
A Note on the Uniqueness of (w, r) Cover-Free Codes. Probl. Inf. Transm. 41(3): 199-203 (2005) - 2004
- [j2]Hyun Kwang Kim, Vladimir S. Lebedev:
On the Optimality of Trivial (w, r)-Cover-Free Codes. Probl. Inf. Transm. 40(3): 195-201 (2004) - 2003
- [j1]Vladimir S. Lebedev:
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes. Probl. Inf. Transm. 39(4): 317-323 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-13 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
