Vladimir S. Lebedev

According to our database, Vladimir S. Lebedev authored at least 38 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Correcting a Single Error in an Asymmetric Feedback Channel.

Ilya V. Vorobyev, Alexey V. Lebedev, Vladimir S. Lebedev

Probl. Inf. Transm., March, 2024

Constructions of Nonbinary Codes Meeting the Johnson Bound.

Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev

Probl. Inf. Transm., March, 2024

2023

Correcting one error in channels with feedback.

Ilya Vorobyev, Alexey S. Lebedev, Vladimir S. Lebedev, Christian Deppe

CoRR, 2023

Correcting One Error in Non-Binary Channels with Feedback.

Ilya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Two-Stage Coding Over the Z-Channel.

Alexey V. Lebedev, Vladimir S. Lebedev, Nikita Polyanskii

IEEE Trans. Inf. Theory, 2022

Coding With Noiseless Feedback Over the Z-Channel.

Christian Deppe, Vladimir S. Lebedev, Georg Maringer, Nikita Polyanskii

IEEE Trans. Inf. Theory, 2022

Correcting a Single Error in Feedback Channels.

Ilya V. Vorobyev, Christian Deppe, Alexey V. Lebedev, Vladimir S. Lebedev

Probl. Inf. Transm., 2022

Improved Upper Bounds for the Rate of Separating and Completely Separating Codes.

Ilya V. Vorob'ev, Vladimir S. Lebedev

Probl. Inf. Transm., 2022

Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound.

Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev

Probl. Inf. Transm., 2022

Non-adaptive and two-stage coding over the Z-channel.

Alexey V. Lebedev, Ilya Vorobyev, Vladimir S. Lebedev, Christian Deppe

CoRR, 2022

2021

Bounds for the capacity error function for unidirectional channels with noiseless feedback.

Christian Deppe, Vladimir S. Lebedev, Georg Maringer

Theor. Comput. Sci., 2021

Coding in a Z-Channel in Case of Many Errors.

Vladimir S. Lebedev, N. A. Polyanskii

Probl. Inf. Transm., 2021

Algorithms for q-ary error-correcting codes with limited magnitude and feedback.

Christian Deppe, Vladimir S. Lebedev

Discret. Math., 2021

2020

Symmetric Block Designs and Optimal Equidistant Codes.

Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev

Probl. Inf. Transm., 2020

How to apply the rubber method for channels with feedback.

Christian Deppe, Georg Maringer, Vladimir S. Lebedev

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019

Search for a Moving Element with the Minimum Total Cardinality of Tests.

Alexey V. Lebedev, Vladimir S. Lebedev

Probl. Inf. Transm., 2019

Algorithms for Q-ary Error-Correcting Codes with Partial Feedback and Limited Magnitude.

Christian Deppe, Vladimir S. Lebedev

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

On Metric Dimension of Nonbinary Hamming Spaces.

Gregory A. Kabatiansky, Vladimir S. Lebedev

Probl. Inf. Transm., 2018

On <i>m</i>-Near-Resolvable Block Designs and <i>q</i>-ary Constant-Weight Codes.

Leonid A. Bassalygo, Victor A. Zinoviev, Vladimir S. Lebedev

Probl. Inf. Transm., 2018

A Combinatorial Model of Two-Sided Search.

Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev

Int. J. Found. Comput. Sci., 2018

2017

Adaptive search for one defective in the additive group testing model.

Vladimir S. Lebedev

Probl. Inf. Transm., 2017

Signature codes for noisy multiple access adder channel.

Vladimir Gritsenko, Grigory Kabatiansky, Vladimir S. Lebedev, Alexey Maevskiy

Des. Codes Cryptogr., 2017

2016

Coding with noiseless feedback.

Vladimir S. Lebedev

Probl. Inf. Transm., 2016

2013

Group testing problem with two defectives.

Christian Deppe, Vladimir S. Lebedev

Probl. Inf. Transm., 2013

Superimposed Codes and Threshold Group Testing.

Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

The Restricted Word Shadow Problem.

Rudolf Ahlswede, Vladimir S. Lebedev

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Threshold and Majority Group Testing.

Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Shadows under the word-subword relation.

Rudolf Ahlswede, Vladimir S. Lebedev

Probl. Inf. Transm., 2012

Finding one of <i>D</i> defective elements in some group testing models.

Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev

Probl. Inf. Transm., 2012

2011

Majority group testing with density tests.

Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Bounds for threshold and majority group testing.

Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

On enumeration of <i>q</i>-ary sequences with a fixed number of occurrences of the subblock 00.

Vladimir S. Lebedev

Probl. Inf. Transm., 2010

Separating codes and a new combinatorial search model.

Vladimir S. Lebedev

Probl. Inf. Transm., 2010

2008

Asymptotic bounds for the rate of colored superimposed codes.

Vladimir S. Lebedev

Probl. Inf. Transm., 2008

2006

Non-binary error correcting codes with noiseless feedback, localized errors, or both.

Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

A Note on the Uniqueness of (<i>w, r</i>) Cover-Free Codes.

Vladimir S. Lebedev

Probl. Inf. Transm., 2005

2004

On the Optimality of Trivial (<i>w</i>, <i>r</i>)-Cover-Free Codes.

Hyun Kwang Kim, Vladimir S. Lebedev

Probl. Inf. Transm., 2004

2003

Asymptotic Upper Bound for the Rate of (<i>w</i>, <i>r</i>) Cover-Free Codes.

Vladimir S. Lebedev

Probl. Inf. Transm., 2003