Maximum-Likelihood Decoding of Gabidulin Codes Is NP-Hard Even in Dimension One
cs.CR, cs.IT, math.IT
Submitted: 2026-10-25
Updated: 2026-10-25
Related papers
- SoK: AI-Augmented Binary Reversing
- Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
- Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
- Estimating the Social Cost of Corporate Data Breaches
- Efficient Fuzzy PSI under One-Sided Assumptions
- Sealing the Audit-Runtime Gap for LLM Skills