اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLocally Recoverable codes with local error detection
101
0
0.0
(
0
)
تأليف
Carlos Munuera
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A locally recoverable code is an error-correcting code such that any erasure in a coordinate of a codeword can be recovered from a set of other few coordinates. In this article we introduce a model of local recoverable codes that also includes local error detection. The cases of the Reed-Solomon and Locally Recoverable Reed-Solomon codes are treated in some detail.
قيم البحث
اقرأ أيضاً
A locally recoverable (LRC) code is a code over a finite field $mathbb{F}_q$ such that any erased coordinate of a codeword can be recovered from a small number of other coordinates in that codeword. We construct LRC codes correcting more than one era
sure, which are subfield-subcodes of some $J$-affine variety codes. For these LRC codes, we compute localities $(r, delta)$ that determine the minimum size of a set $bar{R}$ of positions so that any $delta- 1$ erasures in $bar{R}$ can be recovered from the remaining $r$ coordinates in this set. We also show that some of these LRC codes with lengths $ngg q$ are $(delta-1)$-optimal.
We give a method to construct Locally Recoverable Error-Correcting codes. This method is based on the use of rational maps between affine spaces. The recovery of erasures is carried out by Lagrangian interpolation in general and simply by one addition in some good cases.
A Locally Recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. We study Locally Recoverable Algebraic Geometry codes arising from certain cu
rves defined by equations with separated variables. The recovery of erasures is obtained by means of Lagrangian interpolation in general, and simply by one addition in some particular cases.
A locally recoverable code is an error-correcting code such that any erasure in a single coordinate of a codeword can be recovered from a small subset of other coordinates. In this article we develop an algorithm that computes a recovery structure as
concise posible for an arbitrary linear code $mathcal{C}$ and a recovery method that realizes it. This algorithm also provides the locality and the dual distance of $mathcal{C}$. Complexity issues are studied as well. Several examples are included.
Streaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that diagonally
embedding codewords of a $[tau+1,tau+1-a]$ Maximum Distance Separable (MDS) code within the packet stream, leads to rate-optimal streaming codes capable of recovering from $a$ arbitrary packet erasures, under a strict decoding delay constraint $tau$. Thus MDS codes are geared towards the efficient handling of the worst-case scenario corresponding to the occurrence of $a$ erasures. In the present paper, we have an increased focus on the efficient handling of the most-frequent erasure patterns. We study streaming codes which in addition to recovering from $a>1$ arbitrary packet erasures under a decoding delay $tau$, have the ability to handle the more common occurrence of a single-packet erasure, while incurring smaller delay $r<tau$. We term these codes as $(a,tau,r)$ locally recoverable streaming codes (LRSCs), since our single-erasure recovery requirement is similar to the requirement of locality in a coded distributed storage system. We characterize the maximum possible rate of an LRSC by presenting rate-optimal constructions for all possible parameters ${a,tau,r}$. Although the rate-optimal LRSC construction provided in this paper requires large field size, the construction is explicit. It is also shown that our $(a,tau=a(r+1)-1,r)$ LRSC construction provides the additional guarantee of recovery from the erasure of $h, 1 leq h leq a$, packets, with delay $h(r+1)-1$. The construction thus offers graceful degradation in decoding delay with increasing number of erasures.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
