This paper presents an adaptive hybrid Chase-like algorithm for Reed-Solomon codes, which is based on the list decoding algorithm. The adaptive hybrid algorithm is based on the reliability threshold to exclude the more reliable bits from being processed by the list decoding algorithm and reduce the complexity of the hybrid algorithm. Simulation results show that the decoding complexities of the...

Minimum-Storage Regenerating (MSR) codes have emerged as a viable alternative to Reed-Solomon (RS) codes as they minimize the repair bandwidth while they are still optimal in terms of reliability and storage overhead. Although several MSR constructions exist, so far they have not been practically implemented mainly due to the big number of I/O operations. In this paper, we analyze high-rate MDS...

| In this work we studied the performance of the hybrid type-II Automatic Repeat reQuest (ARQ) system on Rayleigh fading channels. This system is based on High Rate Optimized Rate Compatible Punctured Convolutional (HRO-RCPC) codes combined with simple repetition codes. The performance is investigated for diierent packet sizes and constraint lengths of the convolutional encoder. Additionally th...

This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special low-density paritycheck (LDPC) codes consisting of several trees with large spans. They can also be regarded as special turbo codes with hybrid recursive/nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm. They combine many advantages of LDPC and...

In this paper, we propose a class of new threshold secret sharing schemes with repairing function between shares. Specifically, each share, when it is broken or lost, can be repaired by some others without the help of the dealer. Further, a construction of such repairable threshold secret sharing schemes is designed by applying linearized polynomials and regenerating codes in distributed storag...

Large distributed storage systems use erasure codes to reliably store data. Compared to replication, erasure codes are capable of reducing storage overhead. However, repairing lost data in an erasure coded system requires reading from many storage devices and transferring over the network large amounts of data. Theoretically, Minimum Storage Regenerating (MSR) codes can significantly reduce thi...

To provide fault tolerance for cloud storage, recent studies propose to stripe data across multiple cloud vendors. However, if a cloud suffers from a permanent failure and loses all its data, then we need to repair the lost data from other surviving clouds to preserve data redundancy. We present a proxy-based system for multiple-cloud storage called NCCloud, which aims to achieve cost-effective...

In this paper, an efficient partial incremental redundancy (P-IR) scheme is proposed for an H-ARQ using block type low density parity check (B-LDPC) codes. The performance of the proposed P-IR scheme is evaluated in an HSDPA system using IEEE 802.16e B-LDPC codes. Simulation results show that the proposed H-ARQ using IEEE 802.16e BLDPC codes outperforms the H-ARQ using 3GPP turbo codes. key wor...

An $(n, k, d, \alpha, \beta, M)$-ERRC (exact-repair regenerating code) is a collection of $n$ nodes used to store file. For file total size $M$, each node stores $\alpha$ symbols, any $k$ recover the file, and $d$ repair other via sending out $\beta$ symbols. We establish multilinear algebra foundation assemble M)$-ERRCs for all meaningful d)$ tuples. Our ERRCs tie $\alpha/M$-versus-$\beta/M$ t...