BCH
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields
Announce Type: replace Abstract: In this work, We introduce a new upper bound on the Hamming distance of simple-root constacyclic codes over finite fields, which we call the arithmetic Singleton bound. The main technical tool is the notion of a multiple equal-difference (MED) representation. Via the MED representations of the defining set of the generator polynomial of a simple-root constacyclic code, we obtain a family of upper bounds on its Hamming distance, among which the weakest one...
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.