Learn More
spatially coupled Low-Density Parity-Check (LDPC) codes, non-binary LDPC codes, and any channel and hence generalise the concept of error correction to general codes can be decoded in a continuous fashion using a sliding window de-ing, non-uniform window decoding schedules has been introduced. First, twenty four original Low-Density Parity Check (LDPC)(More)
—This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study the iterative and maximum-likelihood (ML) decoding of LDPC codes on this channel. We derive bounds on the ML decoding of LDPC codes on the BEC. We then present an improved decoding algorithm. The proposed algorithm has almost the same(More)
—In this paper, we propose a scheme to construct low-density parity-check (LDPC) codes that are suitable for unequal error protection (UEP). We derive density evolution (DE) formulas for the proposed unequal error protecting LDPC ensembles over the binary erasure channel (BEC). Using the DE formulas, we optimize the codes. For the finite-length cases, we(More)
—It is generally believed harmful to have transmission errors in the wireless communications. The high decoding complexity of dense parity check codes is unfavorable. This paper proposes to apply these two " negative " facts to enable the secrecy sharing with the information theoretical security. We claim that the secrecy sharing is always possible if the(More)
—Conventional hybrid RF and optical wireless communication systems make use of parallel Free Space Optical (FSO) and Radio Frequency (RF) channels to achieve higher reliability than individual channels. True hybridization can be accomplished when both channels collaboratively compensate the shortcomings of each other and thereby improve the performance of(More)
—This paper first introduces an improved decoding algorithm for low-density parity-check (LDPC) codes over binary-input–output-symmetric memoryless channels. Then some fundamental properties of punctured LDPC codes are presented. It is proved that for any ensemble of LDPC codes, there exists a puncturing threshold. It is then proved that for any rates R1(More)
—Physical layer secrecy in wireless networks in the presence of eavesdroppers of unknown location is considered. In contrast to prior schemes, which have expended energy in the form of cooperative jamming to enable secrecy, we develop schemes where multiple transmitters send their signals in a cooperative fashion to confuse the eavesdroppers. Hence, power(More)
— In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density Parity-Check (LDPC) codes. We will show that our proposed scheme outperforms conventional concatenation schemes formed by LDPC(More)