Repairing Multiple Failures for Scalar MDS Codes
نویسندگان
چکیده
منابع مشابه
Repairing Reed-Solomon Codes With Multiple Erasures
Despite their exceptional error-correcting properties, Reed-Solomon (RS) codes have been overlooked in distributed storage applications due to the common belief that they have poor repair bandwidth: A naive repair approach would require the whole file to be reconstructed in order to recover a single erased codeword symbol. In a recent work, Guruswami and Wootters (STOC’16) proposed a single-era...
متن کاملRepairing Erasure Codes
Distributed storage systems introduce redundancy to increase reliability. When erasure coding is used, the exact repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to create encoded information at a new node. This amounts to a partial recovery of the code, whereas conventional erasure coding focuses on the complete reco...
متن کاملExtending MDS Codes
A q-ary (n,k)-MDS code, linear or not, satisfies n≤ q+ k−1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show that an MDS code with n = q + k− 2 can be uniquely extended to a full length code if and only if q is even. This result is best possible in the sense that there is, for example, a non-extendable 4-ary (5,4)-MDS code. It may be that the ...
متن کاملAlmost MDS Codes
MDS codes are codes meeting the Singleton bound. Both for theory and practice, these codes are very important and have been studied extensively. Codes near this bound, but not attaining it, have had far less attention. In this paper we study codes that almost reach the Singleton bound.
متن کاملOn MDS elliptic codes
Munuera, C., On MDS elliptic codes, Discrete Mathematics 117 (1993) 2799286. In this paper we give a bound for MDS (maximum distance separable) algebraic-geometric codes arising from elliptic curves. Several consequences are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2876542