Saved in:
| Main Authors: | Ramkumar, Vinayak, Raviv, Netanel, Tamo, Itzhak |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.05845 |
| 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)
by: Ramkumar, Vinayak, et al.
Published: (2024)
Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024)
by: Sharma, Sandeep, et al.
Published: (2024)
Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
by: Deng, Zirui, et al.
Published: (2024)
by: Deng, Zirui, et al.
Published: (2024)
Individual Confidential Computing of Polynomials over Non-Uniform Information
by: Tarnopolsky, Saar, et al.
Published: (2025)
by: Tarnopolsky, Saar, et al.
Published: (2025)
Linear Codes for Hyperdimensional Computing
by: Raviv, Netanel
Published: (2024)
by: Raviv, Netanel
Published: (2024)
Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
by: Berman, Amit, et al.
Published: (2023)
by: Berman, Amit, et al.
Published: (2023)
Algebraic Expander Codes
by: Kopparty, Swastik, et al.
Published: (2026)
by: Kopparty, Swastik, et al.
Published: (2026)
Single Fragment Forensic Coding from Discrepancy Theory
by: Liu, Junsheng, et al.
Published: (2025)
by: Liu, Junsheng, et al.
Published: (2025)
Improved Torn Paper Coding via Local Alignment
by: Liu, Junsheng, et al.
Published: (2026)
by: Liu, Junsheng, et al.
Published: (2026)
Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)
by: Berman, Amit, et al.
Published: (2026)
Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)
by: Langberg, Michael, et al.
Published: (2025)
Break-Resilient Codes
by: Wang, Canran, et al.
Published: (2023)
by: Wang, Canran, et al.
Published: (2023)
Break-Resilient Codes with Loss Tolerance
by: Wang, Canran, et al.
Published: (2026)
by: Wang, Canran, et al.
Published: (2026)
Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
by: Con, Roni, et al.
Published: (2023)
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)
by: Berman, Amit, et al.
Published: (2024)
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
by: Con, Roni, et al.
Published: (2024)
by: Con, Roni, et al.
Published: (2024)
On the Encoding Process in Decentralized Systems
by: Wang, Canran, et al.
Published: (2024)
by: Wang, Canran, et al.
Published: (2024)
Efficient Vector Symbolic Architectures from Histogram Recovery
by: Deng, Zirui, et al.
Published: (2025)
by: Deng, Zirui, et al.
Published: (2025)
The Whole Is Less than the Sum of Parts: Subsystem Inconsistency in Partial Information Decomposition
by: Lyu, Aobo, et al.
Published: (2025)
by: Lyu, Aobo, et al.
Published: (2025)
Structural Impossibility of Antichain-Lattice Partial Information Decomposition
by: Lyu, Aobo, et al.
Published: (2026)
by: Lyu, Aobo, et al.
Published: (2026)
Multivariate Partial Information Decomposition: Constructions, Inconsistencies, and Alternative Measures
by: Lyu, Aobo, et al.
Published: (2025)
by: Lyu, Aobo, et al.
Published: (2025)
Closed-Form Gaussian Estimators for Multi-Source Partial Information Decomposition
by: Lyu, Aobo, et al.
Published: (2026)
by: Lyu, Aobo, et al.
Published: (2026)
Making it to First: The Random Access Problem in DNA Storage
by: Boruchovsky, Avital, et al.
Published: (2025)
by: Boruchovsky, Avital, et al.
Published: (2025)
Explicit Formula for Partial Information Decomposition
by: Lyu, Aobo, et al.
Published: (2024)
by: Lyu, Aobo, et al.
Published: (2024)
Pure-State Quantum Tomography with Minimal Rank-One POVMs
by: Edidin, Dan, et al.
Published: (2025)
by: Edidin, Dan, et al.
Published: (2025)
Gram-Schmidt Methods for Unsupervised Feature Extraction and Selection
by: Yaghooti, Bahram, et al.
Published: (2023)
by: Yaghooti, Bahram, et al.
Published: (2023)
Coding Schemes for Document Exchange under Multiple Substring Edits
by: Narayanan, Hrishi, et al.
Published: (2026)
by: Narayanan, Hrishi, et al.
Published: (2026)
New Bounds and Constructions for Variable Packet-Error Coding
by: Kong, Xiangliang, et al.
Published: (2025)
by: Kong, Xiangliang, et al.
Published: (2025)
Combinatorial alphabet-dependent bounds for insdel codes
by: Kong, Xiangliang, et al.
Published: (2024)
by: Kong, Xiangliang, et al.
Published: (2024)
On MDS Convertible Codes in the Merge Regime
by: Ramkumar, Vinayak, et al.
Published: (2025)
by: Ramkumar, Vinayak, et al.
Published: (2025)
Private Information Retrieval on Multigraph-Based Replicated Storage
by: Meel, Shreya, et al.
Published: (2025)
by: Meel, Shreya, et al.
Published: (2025)
New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
by: Kong, Xiangliang, et al.
Published: (2025)
by: Kong, Xiangliang, et al.
Published: (2025)
SCL Decoding of Non-Binary Linear Block Codes
by: Lin, Jingyu, et al.
Published: (2025)
by: Lin, Jingyu, et al.
Published: (2025)
Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
by: Ma, Lan, et al.
Published: (2025)
by: Ma, Lan, et al.
Published: (2025)
Fast Polarisation-Aware Decoder for Non-Binary Polar Codes
by: Jabbour, Joseph, et al.
Published: (2025)
by: Jabbour, Joseph, et al.
Published: (2025)
Binary and Non-Binary Self-Dual Sequences and Maximum Period Single-Track Gray Codes
by: Etzion, Tuvi
Published: (2025)
by: Etzion, Tuvi
Published: (2025)
On Low Field Size Constructions of Access-Optimal Convertible Codes
by: Chopra, Saransh, et al.
Published: (2024)
by: Chopra, Saransh, et al.
Published: (2024)
Low-Complexity Coding Techniques for Cloud Radio Access Networks
by: Ghaddar, Nadim, et al.
Published: (2024)
by: Ghaddar, Nadim, et al.
Published: (2024)
Modular Hypernetworks for Scalable and Adaptive Deep MIMO Receivers
by: Raviv, Tomer, et al.
Published: (2024)
by: Raviv, Tomer, et al.
Published: (2024)
Quaternary and Component-Binary Spreading Codes with Low Correlation for Navigation Systems
by: Kumar, P. Vijay, et al.
Published: (2024)
by: Kumar, P. Vijay, et al.
Published: (2024)
Similar Items
-
$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024) -
Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024) -
Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
by: Deng, Zirui, et al.
Published: (2024) -
Individual Confidential Computing of Polynomials over Non-Uniform Information
by: Tarnopolsky, Saar, et al.
Published: (2025) -
Linear Codes for Hyperdimensional Computing
by: Raviv, Netanel
Published: (2024)