Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting that combine locality with strong correction capabilities. We construct PMDS SD local regeneration where each code is a bandwidth-optimal regenerating code. In the event node failure, these reduce both, number servers have to be contacted as well amount network traffic required for repair process. The constructions ...

myelodysplastic syndrome (mds), is a group of heterogeneous disorders of hematopoietic stem cell colonies which is determined by incomplete hematopoiesis in one or more cell lines. the incidence increases with age and it has less been reported among patients under 50 years of age. the commonest form of mds is sporadic, and familial occurrence of mds is rare. patients with familial mds are young...

a prescribed node p, nd the maximum density subgraph which contains node p. This can be solved using the 0 ? 1 fractional programming technique in 24] by assigning the variable corresponding to p to 1, and transforming the resulting fractional expression to a series of ow computations. Max-Density Subgraph with Excluded Node problem : Given a hypergraph H(V; E) and a prescribed node p, nd the m...

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication-based methods at a significantly lower storage cost. In particular, it is well known that MaximumDistance-Separable (MDS) codes, such as Reed-Solomon codes, ...

We make the simple observation that the erasure burst correction capability of any (n, k) code can be extended to arbitrary lengths above n with the use of a block interleaver, and discuss nuances of this property when channel symbols are over GF(p) and the code is defined over GF(p ), J > 1. The results imply that maximum distance separable codes (e.g., Reed-Solomon) offer optimal burst erasur...

The problem of private information retrieval gets renewed attentions in recent years due to its information-theoretic reformulation and applications in distributed storage systems. PIR capacity is the maximal number of bits privately retrieved per one bit of downloaded bit. The capacity has been fully solved for some degenerating cases. For a general case where the database is both coded and co...

In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding and by the direct product code construction applied to algebraic geometry codes. The parameters of the new convolutional codes are better than or comparable t...