In this paper, we consider a class of column-weight two quasi-cyclic low-density parity check codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix can be obtained by elementary row and column operations on the parity-check matrix. Finally, we show that the free distance of the convolutio...

Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...

Low-density parity-check codes have recently received extensive attention as a forward error correction scheme in a wide area of applications. The decoding algorithm is inherently parallelizable, allowing communication at high speeds. One of the main disadvantages, however, is large memory requirements for interim storing of decoding data. In this paper, we investigate a modification to the dec...

Absnmt-Tubo deeding oflowdenrily pllityshrek (LDPC) and geme m b e d lowdensity (GLO) coda and the corresponding deeodor amhitoeh m s are mnridrred. A regular (c,r)-LDF'C code of length n is viewed s the interseetion of c intedrrvrd supersods where each smper.de is the dlred sum of n/r indepodent single pa.rity-cheek w b d l s E*dons e GLD coda dmply utilize mom pwellul subsoder. The turbo d d ...

In wireless networks, it has always been a challenge to satisfy high traffic throughput demands, due to limited spectrum resources. In past decades, various techniques, including cooperative communications, have been developed to achieve higher communication rates. This thesis addresses the challenges imposed by cooperative wireless networks, in particular focusing on practical code constructio...