Linearized Polynomial Chinese remainder codes

Summary · qwen2.5:32b

Researchers introduce a new family of codes for rank and sum-rank metrics, leveraging a Chinese Remainder Theorem for linearized polynomials over finite fields; a decoding algorithm is proposed for certain instances of these codes.

Suggested post angle

Exploring a new family of codes for rank and sum-rank metrics in the realm of real-time rendering, based on linearized polynomials over finite fields.

Excerpt

arXiv:2505.15720v2 Announce Type: replace 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.