Nikita Polyanskii

CoRR, 2024

2023

Codes for the Z-Channel.

[BibT_eX]

[DOI]

Yihan Zhang

IEEE Trans. Inf. Theory, October, 2023

Reality-based UTXO Ledger.

[BibT_eX]

[DOI]

Distributed Ledger Technol. Res. Pract., September, 2023

Combinatorial Group Testing in Presence of Deletions.

[BibT_eX]

[DOI]

Venkata Gandikota

Haodong Yang

CoRR, 2023

Codes Correcting a Single Long Duplication Error.

[BibT_eX]

[DOI]

Daniil Goshkoder

Proceedings of the IEEE International Symposium on Information Theory, 2023

Fairness Notions in DAG-Based DLTs.

[BibT_eX]

[DOI]

Mayank Raikwar

Sebastian Müller

Proceedings of the 5th Conference on Blockchain Research & Applications for Innovative Networks and Services, 2023

Dynamic Availability and Definite Finality in IOTA 2.0.

[BibT_eX]

[DOI]

Can Umut Ileri

Proceedings of the Fifth ACM International Workshop on Blockchain-enabled Networked Sensor Systems, 2023

2022

Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Two-Stage Coding Over the Z-Channel.

[BibT_eX]

[DOI]

Alexey V. Lebedev

Vladimir S. Lebedev

IEEE Trans. Inf. Theory, 2022

Coding With Noiseless Feedback Over the Z-Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG.

[BibT_eX]

[DOI]

IEEE Access, 2022

Signature Codes for a Noisy Adder Multiple Access Channel.

[BibT_eX]

[DOI]

Gökberk Erdogan

Georg Maringer

Proceedings of the IEEE Information Theory Workshop, 2022

List-Decodable Zero-Rate Codes for the Z-Channel.

[BibT_eX]

[DOI]

Yihan Zhang

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Lifted Reed-Solomon Codes and Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On List Decoding of Certain 픽<sub>q</sub>-Linear Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2021

Feedback Insertion-Deletion Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2021

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

[BibT_eX]

[DOI]

Vladimir S. Lebedev

Probl. Inf. Transm., 2021

Almost affinely disjoint subspaces.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2021

Quadratic-Curve-Lifted Reed-Solomon Codes.

[BibT_eX]

[DOI]

CoRR, 2021

On learning sparse vectors from mixture of responses.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On Codes for the Noisy Substring Channel.

[BibT_eX]

[DOI]

Yonatan Yehezkeally

Proceedings of the IEEE International Symposium on Information Theory, 2021

On Multiple-Deletion Multiple-Substitution Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Two-Stage Coding over the Z-Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 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

Weight Distributions for Successive Cancellation Decoding of Polar Codes.

[BibT_eX]

[DOI]

Rina Polyanskaya

Mars Davletshin

IEEE Trans. Commun., 2020

On Lifted Multiplicity Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Decoding of Lifted Affine-Invariant Codes.

[BibT_eX]

[DOI]

Lukas Holzbaur

Proceedings of the IEEE Information Theory Workshop, 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

Optimal Codes Correcting a Burst of Deletions of Variable Length.

[BibT_eX]

[DOI]

Andreas Lenz

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

On the metric dimension of Cartesian powers of a graph.

[BibT_eX]

[DOI]

Zilin Jiang

J. Comb. Theory, Ser. A, 2019

How to guess an n-digit number.

[BibT_eX]

[DOI]

Zilin Jiang

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Batch codes based on lifted multiplicity codes.

[BibT_eX]

[DOI]

Rina Polyanskaya

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

Constructions of Batch Codes via Finite Geometry.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

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

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

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

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]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2011

DNA codes for generalized stem similarity.

[BibT_eX]

[DOI]

Julia Volkova