نتایج جستجو برای: mds code
تعداد نتایج: 174935 فیلتر نتایج به سال:
Аннотация The Doob graph D(m, n), where m > 0, is the direct product of m copies of The Shrikhande graph and n copies of the complete graph K 4 on 4 vertices. The Doob graph D(m, n) is a distance-regular graph with the same parameters as the Hamming graph H(2m + n, 4). In this paper we consider MDS codes in Doob graphs with code distance d ≥ 3. We prove that if 2m + n > 6 and 2 < d < 2m + n, th...
We consider a fault-tolerant distributed storage system that protects data on k disks using a systematic linear (n, k) MDS code. In such a system, updates to data blocks require corresponding updates to check blocks. Concurrent fault-prone access by multiple writers can drive the system into an inconsistent state with reduced tolerance for disk failures. We show tight bounds on the erasure reco...
Data on Myelodysplastic Syndromes (MDS) are difficult to collect by cancer registries because of the lack of reporting and the use of different classifications of the disease. In the Lazio Region, data from patients with a confirmed diagnosis of MDS, treated by a hematology center, have been collected since 2002 by the Gruppo Romano-Laziale Mielodisplasie (GROM-L) registry, the second MDS regis...
The hull of a linear code is defined to be the intersection and its dual. When size small, it has been proved that some algorithms for checking permutation equivalence two codes computing automorphism group are very effective in general. Maximum distance separable (MDS) meeting Singleton bound. Twisted Reed-Solomon generalization codes, which also nice construction MDS codes. In this short lett...
It is well known that an (n, k) code can be used to store information in a distributed storage system with n nodes/disks. If the storage capacity of each node/disk is normalized to one unit, the code can be used to store k units of information, where n > k. If the code used is maximum distance separable (MDS), then the storage system can tolerate up to (n−k) disk failures (erasures), since the ...
The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, additive codes do not have the extension property. In this paper, an analogue of the extension theorem for additive codes in the case of additive MDS codes is proved. More precisely, it is shown that for almost all additive MDS codes their additive ...
In this paper, we introduce a lower bound for the generalized Hamming weights, which is applicable to arbitrary linear code, in terms of the notion of well-behaving. We also show that any [n, k] linear code C over a finite field F is the t-th rank MDS for t such that g(C) + 1 ≤ t ≤ k where g(C) is easily calculated from the basis of F so chosen that whose first n − k elements generate C⊥. Final...
This paper investigates the use of redundancy and self repairing against node failures in distributed storage systems, using various strategies. In replication method, access to one replication node is sufficient to reconstruct a lost node, while in MDS erasure coded systems which are optimal in terms of redundancy-reliability tradeoff, a single node failure is repaired after recovering the ent...
More often a new software development methodology called Model Driven Engineering (MDE) is used to increase productivity by supporting powerful code generation tools, which allows a less errorprone implementation process. However the idea of modeling system aspects during the design phase so called Model Driven Security (MDS) was proposed by the scientific community decades ago and yet it is st...
With increase in scale, the number of node failures in a data center increases sharply. To ensure availability of data, failure-tolerance schemes such as ReedSolomon (RS) or more generally, Maximum Distance Separable (MDS) erasure codes are used. However, while MDS codes offer minimum storage overhead for a given amount of failure tolerance, they do not meet other practical needs of today’s dat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید