Optimal Rank-Metric Codes with Rank-Locality from Drinfeld Modules
Abstract
Abstract. We introduce a new technique to construct rank-metric codes using the arithmetic theory of Drinfeld modules and the Dirichlet theorem on polynomial arithmetic progressions. Using our methods, we obtain a new infinite family of optimal rank-metric codes with rank-locality; i.e., every code in our family achieves the information theoretical bound for rank-metric codes with rank-locality.
Fields of Study & Subjects
Coding theory and cryptography
Publication details
- Journal / source
- SIAM Journal on Applied Algebra and Geometry
- Volume
- 10
- Issue
- 2
- Pages
- 467–489
- Publication date
- 24 June 2026
- Language
- EN