Roni Con

Ryan Gabrys

Eitan Yaakobi

CoRR, 2024

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Reed Solomon Codes Against Adversarial Insertions and Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

Optimal Two-Dimensional Reed-Solomon Codes Correcting Insertions and Deletions.

[BibT_eX]

[DOI]

CoRR, 2023

Improved Upper and Lower Bounds on the Capacity of the Binary Deletion Channel.

[BibT_eX]

[DOI]

Ittai Rubinstein

Proceedings of the IEEE International Symposium on Information Theory, 2023

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Nonlinear Repair of Reed-Solomon Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Nonlinear Repair Schemes of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel.

[BibT_eX]

[DOI]