Linearized Polynomial Chinese remainder codes

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.