Learn More
weightdistribution is uniquely determined. In the tables, # lists the numbers of cosets for these weights. For cosets of weights 4; 5; 6; 7; 8; the weight distributions are written using parameters s, t, and the numbers of cosets with a given weight distribution are listed in Tables III–VII, respectively. We remark that the unique coset of weight 11 is the(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)
This paper investigates properties of polar codes that can be potentially useful in real-world applications. We start with analyzing the performance of finite-length polar codes over the binary erasure channel (BEC), while assuming belief propagation as the decoding method. We provide a stopping set analysis for the factor graph of polar codes, where we(More)
—This paper initiates the study of scaling laws for vehicular ad hoc networks (VANET)s. It provides a general framework to study VANETs. The fundamental capacity limits of these networks are investigated and we show how the road geometry affects this capacity. The VANET capacity is calculated for different road structures. The need for new capacity metrics(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)