Itzhak Tamo

IEEE Trans. Inf. Theory, July, 2024

Singleton-type bounds for list-decoding and list-recovery, and related results.

[BibT_eX]

[DOI]

Eitan Goldberg

J. Comb. Theory A, April, 2024

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

ε-MSR Codes for Any Set of Helper Nodes.

[BibT_eX]

[DOI]

CoRR, 2024

Combinatorial alphabet-dependent bounds for insdel codes.

[BibT_eX]

[DOI]

Xiangliang Kong

Hengjia Wei

CoRR, 2024

Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Non-Binary Covering Codes for Low-Access Computations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity.

[BibT_eX]

[DOI]

Amit Berman

Yaron Shany

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Generalized Singleton Bound and List-Decoding Reed-Solomon Codes Beyond the Johnson Radius.

[BibT_eX]

[DOI]

SIAM J. Comput., June, 2023

Reed Solomon Codes Against Adversarial Insertions and Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

List-Decoding and List-Recovery of Reed-Solomon Codes Beyond the Johnson Radius for Every Rate.

[BibT_eX]

[DOI]

Eitan Goldberg

IEEE Trans. Inf. Theory, April, 2023

Bounds on the Capacity of Private Information Retrieval Over Graphs.

[BibT_eX]

[DOI]

Bar Sadeh

Yujie Gu

IEEE Trans. Inf. Forensics Secur., 2023

Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes.

[BibT_eX]

[DOI]

CoRR, 2023

Points-Polynomials Incidence Theorem with Applications to Coding Theory.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes.

[BibT_eX]

[DOI]

Amit Berman

Yaron Shany

CoRR, 2023

Access-Redundancy Tradeoffs in Quantized Linear Computations.

[BibT_eX]

[DOI]

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

Coefficient Complexity in Low-Access Quantized Linear Computations.

[BibT_eX]

[DOI]

Proceedings of the 59th Annual Allerton Conference on Communication, 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

Repairing Reed-Solomon Codes Evaluated on Subspaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A construction of maximally recoverable codes.

[BibT_eX]

[DOI]

Zitan Chen

Des. Codes Cryptogr., 2022

Nonlinear Repair Schemes of Reed-Solomon Codes.

[BibT_eX]

[DOI]

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

2021

Multivariate Public Key Cryptosystem from Sidon Spaces.

[BibT_eX]

[DOI]

Ben Langton

IACR Cryptol. ePrint Arch., 2021

Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions.

[BibT_eX]

[DOI]

CoRR, 2021

List-decoding and list-recovery of Reed-Solomon codes beyond the Johnson radius for any rate.

[BibT_eX]

[DOI]

Eitan Goldberg

CoRR, 2021

Bounds on the Capacity of PIR over Graphs.

[BibT_eX]

[DOI]

Bar Sadeh

Yujie Gu

Proceedings of the IEEE International Symposium on Information Theory, 2021

Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

On Fault Tolerance, Locality, and Optimality in Locally Repairable Codes.

[BibT_eX]

[DOI]

ACM Trans. Storage, 2020

Error Correction Based on Partial Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Private Information Retrieval in Graph-Based Replication Systems.

[BibT_eX]

[DOI]

Eitan Yaakobi

IEEE Trans. Inf. Theory, 2020

Gradient Coding From Cyclic MDS Codes and Expander Graphs.

[BibT_eX]

[DOI]

Rashish Tandon

Alexandros G. Dimakis

IEEE Trans. Inf. Theory, 2020

Minimum Guesswork With an Unreliable Oracle.

[BibT_eX]

[DOI]

Natan Ardimanov

Ofer Shayevitz

IEEE Trans. Inf. Theory, 2020

New Turán Exponents for Two Extremal Hypergraph Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Sparse Hypergraphs with Applications to Coding Theory.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

The hat guessing number of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Degenerate Turán densities of sparse hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Improved List-Decodability of Reed-Solomon Codes via Tree Packings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2020

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Error Detection and Correction in Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

The Repair Problem for Reed-Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Universally Sparse Hypergraphs with Applications to Coding Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Construction of Sidon Spaces With Applications to Coding.

[BibT_eX]

[DOI]

Ron M. Roth

IEEE Trans. Inf. Theory, 2018

MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Exploiting Locality for Improved Decoding of Binary Cyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2018

A Bound on the Shannon Capacity via a Linear Programming Variation.

[BibT_eX]

[DOI]

Sihuang Hu

Ofer Shayevitz

SIAM J. Discret. Math., 2018

The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size.

[BibT_eX]

[DOI]

CoRR, 2018

Optimal LRC codes for all lenghts n≤q.

[BibT_eX]

[DOI]

CoRR, 2018

Private Information Retrieval is Graph Based Replication Systems.

[BibT_eX]

[DOI]

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

2017

Optimal Rebuilding of Multiple Erasures in MDS Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Locally Recoverable Codes on Algebraic Curves.

[BibT_eX]

[DOI]

Serge G. Vladut

IEEE Trans. Inf. Theory, 2017

Fractional decoding: Error correction from partial information.

[BibT_eX]

[DOI]

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

∊-MSR codes with small sub-packetization.

[BibT_eX]

[DOI]

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

Cyclic subspace codes and sidon spaces.

[BibT_eX]

[DOI]

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

A study on the impact of locality in the decoding of binary cyclic codes.

[BibT_eX]

[DOI]

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

Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Explicit Minimum Storage Regenerating Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Optimal Locally Repairable Codes and Connections to Matroid Theory.

[BibT_eX]

[DOI]

Dimitris S. Papailiopoulos

Alexandros G. Dimakis

IEEE Trans. Inf. Theory, 2016

Bounds on the Parameters of Locally Recoverable Codes.

[BibT_eX]

[DOI]

Alexey A. Frolov

IEEE Trans. Inf. Theory, 2016

Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes.

[BibT_eX]

[DOI]

Int. J. Inf. Coding Theory, 2016

Combinatorial and LP bounds for LRC codes.

[BibT_eX]

[DOI]

Sihuang Hu

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Cyclic LRC codes and their subfield subcodes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Access Versus Bandwidth in Codes for Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

A Family of Optimal Locally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes.

[BibT_eX]

[DOI]

Sreechakra Goparaju

A. Robert Calderbank

IEEE Trans. Inf. Theory, 2014

Explicit MDS Codes for Optimal Repair Bandwidth.

[BibT_eX]

[DOI]

CoRR, 2014

Bounds on locally recoverable codes with multiple recovering sets.

[BibT_eX]

[DOI]

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

2013

Zigzag Codes: MDS Array Codes With Optimal Rebuilding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

On the Labeling Problem of Permutation Group Codes Under the Infinity Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Long MDS codes for optimal repair bandwidth.

[BibT_eX]

[DOI]

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

Access vs. bandwidth in codes for storage.

[BibT_eX]

[DOI]

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

2011

Optimal permutation anticodes with the infinity norm via permanents of (0, 1)-matrices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

On optimal anticodes over permutations with the infinity norm.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

MDS array codes with optimal rebuilding.

[BibT_eX]

[DOI]

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

On codes for optimal rebuilding access.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Correcting limited-magnitude errors in the rank-modulation scheme.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On the Size of Optimal Anticodes over Permutations with the Infinity Norm

[BibT_eX]

[DOI]