نتایج جستجو برای: mds code
تعداد نتایج: 174935 فیلتر نتایج به سال:
In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363–377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (J. Combin. Theory Ser. A 33 (1982), 158–166 and Israel J. Math. 51 (1985), 75–89). In the present paper, we consider a ...
RC (Random/Clustered) codes are a new efficient array-code family for recovering from 4-erasures. RC codes correct most 4-erasures, and essentially all 4-erasures that are clustered. Clustered erasures are introduced as a new erasure model for storage arrays. This model draws its motivation from correlated device failures, that are caused by physical proximity of devices, or by age proximity of...
We prove that for any positive integers n and k such that n≥ k≥ 1, there exists an [n, k] generalized Reed-Solomon (GRS) code that has a sparsest and balanced generator matrix (SBGM) over any finite field of size q ≥ n+ ⌈ k(k−1) n ⌉, where sparsest means that each row of the generator matrix has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two c...
A linear code with parameters of the form [n,k,n?k+1] is referred to as an MDS (maximum distance separable) code. [n,k,n?k] said be almost (i.e., maximum or AMDS for short. near separable (in short, NMDS) if both and its dual are separable. Near codes correspond interesting objects in finite geometry have nice applications combinatorics cryptography. There many unsolved problems about codes. It...
Group classification of the generalized complex Ginzburg-Landau equations is presented. An approach to group classification of systems of reaction-diffusion equations with general diffusion matrix is developed.
An Optimal Disk Allocation Strategy for Partial Match Queries on Non-Uniform Cartesian Product Files
The disk allocation problem addresses the issue of how to distribute a file on to several disks to maximize the concurrent disk accesses in response to a partial match query. In the past this problem has been studied for binary as well as for p-ary cartesian product files. In this paper, we propose a disk allocation strategy for non-uniform cartesian product files by a coding theoretic approach...
Myelodysplastic syndromes (MDS) are a heterogeneous group of hematologic malignancies. Although most MDS patients have normal or increased BM cellularity (NH-MDS), some have hypocellular BM (h-MDS). The reports concerning the differences in genetic alterations between h-MDS and NH-MDS patients are limited. In this study, 369 MDS patients diagnosed according to the WHO 2008 criteria were recruit...
This paper describes an enhancement of content access Quality of Service in peer to peer (P2P) networks. The main idea is to use an erasure code to distribute the information over the peers. This distribution increases the users’ choice on disseminated encoded data and therefore statistically enhances the overall throughput of the transfer. A performance evaluation based on an original model us...
We consider linear codes in the metric space with the Niederreiter-Rosenbloom-Tsfasman (NRT) metric, calling them linear ordered codes. In the first part of the paper we examine a linear-algebraic perspective of linear ordered codes, focusing on the distribution of “shapes” of codevectors. We define a multivariate Tutte polynomial of the linear code and prove a duality relation for the Tutte po...
Subsystem codes are a generalization of noiseless subsystems, decoherence free subspaces, and quantum error-correcting codes. We prove a Singleton bound for Fqlinear subsystem codes. It follows that no subsystem code over a prime field can beat the Singleton bound. On the other hand, we show the remarkable fact that there exist impure subsystem codes beating the Hamming bound. A number of open ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید