Linearized Polynomial Chinese remainder codes

May 21, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Philippe Gaborit, Camille Garnier, Olivier Ruatta arXiv ID 2505.15720 Category math.RA Cross-listed cs.IT, cs.SC Citations 0 Venue arXiv.org Last Checked 3 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.RA

Died the same way β€” πŸ‘» Ghosted