نتایج جستجو برای: mds code
تعداد نتایج: 174935 فیلتر نتایج به سال:
To guarantee that some implementation of a cryptographic scheme is secure against side channel analysis, one needs to formally prove its leakage resilience. A relatively recent trend is to apply methods pertaining to the field of Multi-Party Computation: in particular this means applying secret sharing techniques to design masking countermeasures. It is known besides that there is a strong conn...
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. On the other hand, being optimal codes, maxim...
In this paper, we study the weight spectrum of linear codes with super-linear field size and use probabilistic method to show that for nearly all such codes, corresponding is very close a maximum distance separable (MDS) code.
This paper presents an explicit construction for an ((n, k, d), (α, β)) regenerating code over a field FQ operating at the Minimum Storage Regeneration (MSR) point. The parameters of the MSR code can be expressed in terms of two auxiliary parameters (q, t), q ≥ 2, t ≥ 2: n = qt, k = q(t−1), d = (n−1), α = q and β = qt−1. The required field size Q is no larger than n. The MSR code can thus be co...
In Distributed Storage Systems (DSSs), usually, data is stored using replicated packets on different chunk servers. Recently a new paradigm of Fractional Repetition (FR) codes have been introduced, in which, data is replicated in a smart way on distributed servers using a Maximum Distance Separable (MDS) code. In this work, for a non-uniform FR code, bounds on the FR code rate and DSS code rate...
The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices. Numerous erasure coding techniques have been developed that can implement RAID-6; however, each has limitations. In this paper, we describe a new class of RAID-6 codes called the Liberation Codes. These codes encode, update and decode either optimally or close to optimal...
RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) ...
For the category of group codes, that generalizes the category of linear codes over a finite field, and with the generalized notions of direct sums and indecomposable group codes, we prove that every MDS non trivial code, every perfect non trivial code, and every constant weight nondegenerate group code are indecomposable. We prove that every group code is a direct sum of indecomposable group c...
Many applications, such as wireless communications, high speed multimedia data streaming systems and sensor networks, call for strong ciphers with low computation complexity and high speed in encryption and decryption. Additive stream ciphers usually have lower computation complexity and thus provide higher encryption/decryption speed than block ciphers. An additive stream cipher usually encryp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید