Imagen de Portada

Quantum Locally Recoverable Codes via Good Polynomials

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sharma, Sandeep, Ramkumar, Vinayak, Tamo, Itzhak
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Algebraic Expander Codes
por: Kopparty, Swastik, et al.
Publicado: (2026)

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

Bounds on Box Codes
por: Langberg, Michael, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

List Privacy Under Function Recoverability
por: Nageswaran, Ajaykrishnan, et al.
Publicado: (2023)

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

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

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

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

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

Polynomials, Divided Differences, and Codes
por: Venkitesh, S.
Publicado: (2024)

Locality vs Quantum Codes
por: Dai, Samuel, et al.
Publicado: (2024)