Imagen de Portada

Non-Binary Covering Codes for Low-Access Computations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ramkumar, Vinayak, Raviv, Netanel, 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)

Quantum Locally Recoverable Codes via Good Polynomials
por: Sharma, Sandeep, et al.
Publicado: (2024)

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

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

Linear Codes for Hyperdimensional Computing
por: Raviv, Netanel
Publicado: (2024)

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

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

Single Fragment Forensic Coding from Discrepancy Theory
por: Liu, Junsheng, et al.
Publicado: (2025)

Improved Torn Paper Coding via Local Alignment
por: Liu, Junsheng, et al.
Publicado: (2026)

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

Break-Resilient Codes
por: Wang, Canran, et al.
Publicado: (2023)

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

Break-Resilient Codes with Loss Tolerance
por: Wang, Canran, et al.
Publicado: (2026)

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)

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

On the Encoding Process in Decentralized Systems
por: Wang, Canran, et al.
Publicado: (2024)

The Whole Is Less than the Sum of Parts: Subsystem Inconsistency in Partial Information Decomposition
por: Lyu, Aobo, et al.
Publicado: (2025)

Structural Impossibility of Antichain-Lattice Partial Information Decomposition
por: Lyu, Aobo, et al.
Publicado: (2026)

Multivariate Partial Information Decomposition: Constructions, Inconsistencies, and Alternative Measures
por: Lyu, Aobo, et al.
Publicado: (2025)

Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition
por: Lyu, Aobo, et al.
Publicado: (2026)

Efficient Vector Symbolic Architectures from Histogram Recovery
por: Deng, Zirui, et al.
Publicado: (2025)

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

Explicit Formula for Partial Information Decomposition
por: Lyu, Aobo, et al.
Publicado: (2024)

Gram-Schmidt Methods for Unsupervised Feature Extraction and Selection
por: Yaghooti, Bahram, et al.
Publicado: (2023)

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

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

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)

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

SCL Decoding of Non-Binary Linear Block Codes
por: Lin, Jingyu, et al.
Publicado: (2025)

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

Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
por: Ma, Lan, et al.
Publicado: (2025)

Fast Polarisation-Aware Decoder for Non-Binary Polar Codes
por: Jabbour, Joseph, et al.
Publicado: (2025)

Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes
por: Etzion, Tuvi
Publicado: (2025)

On Low Field Size Constructions of Access-Optimal Convertible Codes
por: Chopra, Saransh, et al.
Publicado: (2024)

Low-Complexity Coding Techniques for Cloud Radio Access Networks
por: Ghaddar, Nadim, et al.
Publicado: (2024)

Quaternary and Component-Binary Spreading Codes with Low Correlation for Navigation Systems
por: Kumar, P. Vijay, et al.
Publicado: (2024)

The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
por: Yohananov, Lev, et al.
Publicado: (2024)

LDPC Codes for Quantitative Group Testing with a Non-Binary Alphabet
por: Mashauri, Mgeni Makambi, et al.
Publicado: (2024)