We show that the problem of code construction for multiple access channel (MAC) resolvability can be reduced to simpler source resolvability. Specifically, we propose a MAC relies on combination codes, used in black-box manner, and leverages randomness recycling implemented via distributed hashing block-Markov coding. Since explicit codes are known, our results also yield first coding schemes a...

Symbol-pair codes are proposed to protect against pair-errors in symbol-pair read channels. The research of with the largest possible minimum distance is great significance since such have best error-correcting capability. A code meeting Singleton bound called a maximum separable (MDS) code. In this paper, two new classes MDS by utilizing repeated-root cyclic over finite fields odd characterist...

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...