Linearized Polynomial Chinese remainder codes
May 21, 2025 Β· Declared Dead Β· π arXiv.org
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.RA
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Good Integers and Applications in Coding Theory
R.I.P.
π»
Ghosted
Generalized iterated-sums signatures
R.I.P.
π»
Ghosted
Tropical time series, iterated-sums signatures and quasisymmetric functions
R.I.P.
π»
Ghosted
Wajsberg algebras arising from binary block codes
R.I.P.
π»
Ghosted
Constacyclic and Quasi-Twisted Hermitian Self-Dual Codes over Finite Fields
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted