Locality for Codes over the Integers
Abstract
In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over Z/q1Z × ·s × Z/qnZ and derive a Singleton-like bound for locally recoverable codes. We also propose some code constructions with locality, including integer analogs of Tamo--Barg codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.