Proximity Gaps for Gabidulin Codes and Applications
cs.IT, cs.CR, math.IT
Submitted: 2026-09-09
Updated: 2026-09-09
Comments: 40 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Related papers
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
- Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions