Linearized Polynomial Chinese remainder codes
Rings and Algebras
2025-05-22 v1 Information Theory
Symbolic Computation
math.IT
Abstract
In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for some instances of these codes.
Cite
@article{arxiv.2505.15720,
title = {Linearized Polynomial Chinese remainder codes},
author = {Philippe Gaborit and Camille Garnier and Olivier Ruatta},
journal= {arXiv preprint arXiv:2505.15720},
year = {2025}
}
Comments
26 pages, 7 figures