Replication based storage systems with local repair

We consider the design of regenerating codes for distributed storage systems that enjoy the property of local, exact and uncoded repair, i.e., (a) upon failure, a node can be regenerated by simply downloading packets from the surviving nodes and (b) the number of surviving nodes contacted is strictly smaller than the number of nodes that need to be contacted for reconstructing the stored file. Our codes consist of an outer MDS code and an inner fractional repetition code that specifies the placement of the encoded symbols on the storage nodes. For our class of codes, we identify the tradeoff between the local repair property and the minimum distance. We present codes based on graphs of high girth, affine resolvable designs and projective planes that meet the minimum distance bound for specific choices of file sizes

Improvement of strength and water absorption of Interlocking Compressed Earth Bricks (ICEB) with addition of Ureolytic Bacteria (UB)

Interlocking Compressed Earth Brick (ICEB) are cement stabilized soil bricks that allow for dry stacked construction. This characteristic resulted to faster the process of building walls and requires less skilled labour as the bricks are laid dry and lock into place. However there is plenty room for improving the interlocking bricks by increase its durability. Many studies have been conducted in order to improve the durability of bricks by using environmentally method. One of the methods is by introducing bacteria into bricks. Bacteria in brick induced calcite precipitation (calcite crystals) to cover the voids continuously. Ureolytic Bacteria (UB) was used in this study as a partial replacement of limestone water with percentage of 1%, 3% and 5%. Enrichment process was done in soil condition to ensure the survivability of UB in ICEB environment. This paper evaluates the effect of UB in improving the strength and water absorption properties of ICEB and microstructure analysis. The results show that addition of 5% UB in ICEB indicated positive results in improving the ICEB properties by 15.25% in strength, 14.72% in initial water absorption and 14.68% reduction in water absorption. Precipitation of calcium carbonate (CaCo3) in form of calcite can be distinguish clearly in microstructure analysis

On some new approaches to practical Slepian-Wolf compression inspired by channel coding

This paper considers the problem, first introduced by Ahlswede and Körner in 1975, of lossless source coding with coded side information. Specifically, let X and Y be two random variables such that X is desired losslessly at the decoder while Y serves as side information. The random variables are encoded independently, and both descriptions are used by the decoder to reconstruct X. Ahlswede and Körner describe the achievable rate region in terms of an auxiliary random variable. This paper gives a partial solution for the optimal auxiliary random variable, thereby describing part of the rate region explicitly in terms of the distribution of X and Y

Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression

This paper discusses the Slepian–Wolf problem of distributed near-lossless compression of correlated sources. We introduce practical new tools for communicating at all rates in the achievable region. The technique employs a simple “source-splitting” strategy that does not require common sources of randomness at the encoders and decoders. This approach allows for pipelined encoding and decoding so that the system operates with the complexity of a single user encoder and decoder. Moreover, when this splitting approach is used in conjunction with iterative decoding methods, it produces a significant simplification of the decoding process. We demonstrate this approach for synthetically generated data. Finally, we consider the Slepian–Wolf problem when linear codes are used as syndrome-formers and consider a linear programming relaxation to maximum-likelihood (ML) sequence decoding. We note that the fractional vertices of the relaxed polytope compete with the optimal solution in a manner analogous to that observed when the “min-sum” iterative decoding algorithm is applied. This relaxation exhibits the ML-certificate property: if an integral solution is found, it is the ML solution. For symmetric binary joint distributions, we show that selecting easily constructable “expander”-style low-density parity check codes (LDPCs) as syndrome-formers admits a positive error exponent and therefore provably good performance