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 $\mathbb{Z}/q_1\mathbb{Z}\times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ 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.