Related papers: Introducing locality in some generalized AG codes
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
In this paper we simplify and otherwise improve the local resolution of singularities algorithm of [G1]-[G3], providing a local resolution of singularities method that works for functions with convergent power series over an arbitrary local…
Locally repairable codes (LRCs), which can recover any symbol of a codeword by reading only a small number of other symbols, have been widely used in real-world distributed storage systems, such as Microsoft Azure Storage and Ceph Storage…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
The Special Theory of Relativity and Quantum Mechanics merge in the key principle of Quantum Field Theory, the Principle of Locality. We review some examples of its ``unreasonable effectiveness'' (which shows up best in the formulation of…
Let $q$ be a prime power and $\mathbb F_q$ be the finite field of size $q$. In this paper we provide a Galois theoretical framework that allows to produce good polynomials for the Tamo and Barg construction of optimal locally recoverable…
We propose a modification of the non-perturbative renormalization-group (NPRG) which applies to lattice models. Contrary to the usual NPRG approach where the initial condition of the RG flow is the mean-field solution, the lattice NPRG uses…
Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and basic results have been developed on this topic. Recently,…
Motivated by applications in distributed storage, the notion of a locally recoverable code (LRC) was introduced a few years back. In an LRC, any coordinate of a codeword is recoverable by accessing only a small number of other coordinates.…
We consider the complexities of repair algorithms for locally repairable codes and propose a class of codes that repair single node failures using addition operations only, or codes with addition based repair. We construct two families of…
An $(n,k,r)$ \emph{locally repairable code} (LRC) is an $[n,k,d]$ linear code where every code symbol can be repaired from at most $r$ other code symbols. An LRC is said to be optimal if the minimum distance attains the Singleton-like bound…
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg \cite{TB14} first gave a…
In coding theory, a common question is to understand the threshold rates of various local properties of codes, such as their list decodability and list recoverability. A recent work Levi, Mosheiff, and Shagrithaya (FOCS 2025) gave a novel…
Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability. A main limitation of…
In this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed generalized Singleton bounds for list size $L\ge1.$ Specifically, we show the following: (1) FRS code of length $n$ and rate $R$ over the alphabet…
A new type of spatially coupled low-density parity-check (SC-LDPC) codes motivated by practical storage applications is presented. SC-LDPCL codes (suffix 'L' stands for locality) can be decoded locally at the level of sub-blocks that are…
We study loop near-rings, a generalization of near-rings, where the additive structure is not necessarily associative. We introduce local loop near-rings and prove a useful detection principle for localness.
We consider the task of designing Local Computation Algorithms (LCA) for applications of the Lov\'{a}sz Local Lemma (LLL). LCA is a class of sublinear algorithms proposed by Rubinfeld et al.~\cite{Ronitt} that have received a lot of…
We analyze the list-decodability, and related notions, of random linear codes. This has been studied extensively before: there are many different parameter regimes and many different variants. Previous works have used complementary styles…