:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Sharma, Sandeep, Ramkumar, Vinayak, Tamo, Itzhak
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2411.01504
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024)

Non-Binary Covering Codes for Low-Access Computations
by: Ramkumar, Vinayak, et al.
Published: (2024)

Algebraic Expander Codes
by: Kopparty, Swastik, et al.
Published: (2026)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
by: Con, Roni, et al.
Published: (2023)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
by: Berman, Amit, et al.
Published: (2023)

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
by: Con, Roni, et al.
Published: (2024)

Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
by: Deng, Zirui, et al.
Published: (2024)

Pure-State Quantum Tomography with Minimal Rank-One POVMs
by: Edidin, Dan, et al.
Published: (2025)

Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions
by: Liu, Hengfeng, et al.
Published: (2026)

Individual Confidential Computing of Polynomials over Non-Uniform Information
by: Tarnopolsky, Saar, et al.
Published: (2025)

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
by: Resch, Nicolas, et al.
Published: (2025)

Coding Schemes for Document Exchange under Multiple Substring Edits
by: Narayanan, Hrishi, et al.
Published: (2026)

New Bounds and Constructions for Variable Packet-Error Coding
by: Kong, Xiangliang, et al.
Published: (2025)

Combinatorial alphabet-dependent bounds for insdel codes
by: Kong, Xiangliang, et al.
Published: (2024)

On MDS Convertible Codes in the Merge Regime
by: Ramkumar, Vinayak, et al.
Published: (2025)

Secure Storage using Maximally Recoverable Locally Repairable Codes
by: Janz, Tim, et al.
Published: (2024)

Making it to First: The Random Access Problem in DNA Storage
by: Boruchovsky, Avital, et al.
Published: (2025)

$q$-ary Sequential Locally Recoverable Codes from the Product Construction
by: Baghban, Akram, et al.
Published: (2024)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
by: Bastos, Gustavo Terra, et al.
Published: (2024)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
by: Ly, Hoang, et al.
Published: (2026)

Hierarchical Locally Recoverable Codes on surfaces
by: Araujo, Carolina, et al.
Published: (2026)

Quantum $(r,δ)$-Locally Recoverable BCH and Homothetic-BCH Codes
by: Galindo, Carlos, et al.
Published: (2026)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
by: Komech, Sergey, et al.
Published: (2025)

Private Information Retrieval on Multigraph-Based Replicated Storage
by: Meel, Shreya, et al.
Published: (2025)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
by: Baghban, Akram, et al.
Published: (2025)

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
by: Kong, Xiangliang, et al.
Published: (2025)

Relaxed Local Correctability from Local Testing
by: Kumar, Vinayak M., et al.
Published: (2023)

Locally Recoverable Codes with availability from a family of fibered surfaces
by: Salgado, Cecília, et al.
Published: (2025)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
by: Doron, Dean, et al.
Published: (2024)

List Privacy Under Function Recoverability
by: Nageswaran, Ajaykrishnan, et al.
Published: (2023)

Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates
by: Golowich, Louis, et al.
Published: (2024)

Abelian Group Codes for Classical and Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds
by: Pang, James Chin-Jen, et al.
Published: (2024)

Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)

Straggler-Aware Coded Polynomial Aggregation
by: Zhong, Xi, et al.
Published: (2026)