Reed-Solomon
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Robust Repair of Reed-Solomon Codes
arXiv:2606.05573v1 Announce Type: new Abstract: We study the problem of robust repair of a single erasure in Reed--Solomon codes under low communication bandwidth. Focusing on the Guruswami--Wootters trace repair framework, we investigate whether a failed node can be correctly repaired in the presence of erroneous responses from helper nodes. Equivalently, we view the collection of downloaded traces as a code, which we call the repair-trace code.
Implementation and Optimization of HQC Decoding on NPU-Integrated Devices
arXiv:2606.01968v1 Announce Type: new Abstract: Hamming Quasi-Cyclic (HQC) has been selected by NIST for standardization as an additional code-based key-encapsulation mechanism, providing algorithmic diversity alongside lattice-based post-quantum cryptography. Efficient deployment of HQC on mobile and embedded platforms, however, requires careful optimization of its decoding procedure, whose Reed-Muller and Reed-Solomon components dominate the computational cost.
A New Class of Linear Codes
arXiv:2401.07986v3 Announce Type: replace Abstract: Let $n$ be a prime power, $r$ be a prime with $r\mid n-1$, and $\varepsilon\in (0,1/2)$. Using the theory of multiplicative character sums and superelliptic curves, we construct new codes over $\mathbb F_r$ having length $n$, relative distance $(r-1)/r+O(n^{-\varepsilon})$ and rate $n^{-1/2-\varepsilon}$. When $r=2$, our binary codes have exponential size when compared to all previously known families of linear and non-linear codes with...