Ilya Vorobyev

Ying Miao

IEEE Trans. Inf. Theory, April, 2024

Efficient Combinatorial Group Testing: Bridging the Gap between Union-Free and Disjunctive Codes.

[BibT_eX]

[DOI]

Daniil Goshkoder

CoRR, 2024

2023

Covering Codes for the Fixed Length Levenshtein Metric.

[BibT_eX]

[DOI]

Probl. Inf. Transm., July, 2023

Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., April, 2023

Wiener index and graphs, almost half of whose vertices satisfy Šoltés property.

[BibT_eX]

[DOI]

Margarita Akhmejanova

Konstantin Olmezov

Aleksei Volostnov

Konstantin V. Vorob'ev

Yury Yarovikov

Discret. Appl. Math., 2023

Correcting one error in channels with feedback.

[BibT_eX]

[DOI]

CoRR, 2023

Correcting One Error in Non-Binary Channels with Feedback.

[BibT_eX]

[DOI]

Vladimir S. Lebedev

Alexey V. Lebedev

Proceedings of the IEEE International Symposium on Information Theory, 2023

Codes Correcting a Single Long Duplication Error.

[BibT_eX]

[DOI]

Daniil Goshkoder

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Correcting a Single Error in Feedback Channels.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2022

Note on generalized group testing.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

2021

Lifted Reed-Solomon Codes and Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Feedback Insertion-Deletion Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2021

Almost affinely disjoint subspaces.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2021

Fast Decoding of Union-Free Codes.

[BibT_eX]

[DOI]

Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Optimal Codes Correcting Localized Deletions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Binary Batch Codes With Improved Redundancy.

[BibT_eX]

[DOI]

Rina Polyanskaya

IEEE Trans. Inf. Theory, 2020

On Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Optimal Multistage Group Testing Algorithm for 3 Defectives.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Duplication with transposition distance to the root for q-ary strings.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Lifted Reed-Solomon Codes with Application to Batch Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Hypothesis Test for Bounds on the Size of Random Defective Set.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2019

On Capacities of the Two-User Union Channel With Complete Feedback.

[BibT_eX]

[DOI]

Zilin Jiang

IEEE Trans. Inf. Theory, 2019

Separable Codes for the Symmetric Multiple-Access Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Construction of High Performance Block and Convolutional Multi-Edge Type QC-LDPC codes.

[BibT_eX]

[DOI]

Vasiliy Usatyuk

Proceedings of the 42nd International Conference on Telecommunications and Signal Processing, 2019

Trivariate Lifted Codes with Disjoint Repair Groups.

[BibT_eX]

[DOI]

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

New lower bound on the rate of traceability set systems.

[BibT_eX]

[DOI]

Elena Egorova

Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

A New Algorithm for Two-Stage Group Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Constructions of Batch Codes via Finite Geometry.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Simulated Annealing Method for Construction of High-Girth QC-LDPC Codes.

[BibT_eX]

[DOI]

Vasiliy Usatyuk

Proceedings of the 41st International Conference on Telecommunications and Signal Processing, 2018

Generalization of Floor Lifting for QC-LDPC Codes: Theoretical Properties and Applications.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE East-West Design & Test Symposium, 2018

2017

Bounds on the rate of separating codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2017

Almost cover-free codes and designs.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Symmetric disjunctive list-decoding codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Cover-free codes and separating system codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

Floor Scale Modulo Lifting for QC-LDPC codes.

[BibT_eX]

[DOI]

Vasiliy Usatyuk

CoRR, 2017

Bounds for Signature Codes.

[BibT_eX]

[DOI]

CoRR, 2017

Hypothesis test for upper bound on the size of random defective set.

[BibT_eX]

[DOI]

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

2016

Erratum to: "Bounds on the rate of disjunctive codes".

[BibT_eX]

[DOI]

N. A. Polyansky

Probl. Inf. Transm., 2016

Adaptive Learning a Hidden Hypergraph.

[BibT_eX]

[DOI]

CoRR, 2016

Threshold Decoding for Disjunctive Group Testing.

[BibT_eX]

[DOI]

CoRR, 2016

A simple construction of cover-free (s, ℓ)-code with certain constant weight.

[BibT_eX]

[DOI]

CoRR, 2016

Threshold Disjunctive Codes.

[BibT_eX]

[DOI]

Arkady G. D'yachkov

CoRR, 2016

Bounds on the rate of disjunctive codes (in Russian).

[BibT_eX]

[DOI]

CoRR, 2016

On a hypergraph approach to multistage group testing problems.

[BibT_eX]

[DOI]

Arkady G. D'yachkov

Proceedings of the IEEE International Symposium on Information Theory, 2016

On multistage learning a hidden hypergraph.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Almost disjunctive list-decoding codes.

[BibT_eX]

[DOI]

N. A. Polyansky

Probl. Inf. Transm., 2015

2014

Bounds on the rate of disjunctive codes.

[BibT_eX]

[DOI]

N. A. Polyansky

Probl. Inf. Transm., 2014

Almost Cover-Free Codes.

[BibT_eX]

[DOI]

CoRR, 2014

Almost Disjunctive List-Decoding Codes.

[BibT_eX]

[DOI]

CoRR, 2014

Bounds on the rate of superimposed codes.

[BibT_eX]

[DOI]