Hossein Pishro-Nik

Learn 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)
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(More)
This correspondence introduces a framework to design and analyze low-density parity-check (LDPC) codes over nonuniform channels. We study LDPC codes for channels with nonuniform noise distributions, rate-adaptive coding, and unequal error protection. First, we propose a technique to design LDPC codes for volume holographic memory (VHM) systems for which the(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)
LDPC codes are state-of-art error correcting codes, included in and the received samples in LDPC-coded systems using M -QAM schemes. physical layer, especially on the forward-error correction code. (FEC) performance. low-density parity check (LDPC) codes can achieve high Using long FECs with short is possible to apply a non-uniform mapping like for example.(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 is(More)
Polar codes have been recently proposed as the first low complexity class of codes that can provably achieve the capacity of symmetric binary-input memoryless channels. Here, we study the bit error rate performance of finite-length polar codes under Belief Propagation (BP) decoding. We analyze the stopping sets of polar codes and the size of the minimal(More)
Secure communication over a memoryless wiretap channel in the presence of a passive eavesdropper is considered. Traditional information-theoretic security methods require an advantage for the main channel over the eavesdropper channel to achieve a positive secrecy rate, which in general cannot be guaranteed in wireless systems. Here, we exploit the(More)
Information-theoretic security guarantees that a message is kept secret from potential eavesdroppers regardless of their current or future computational abilities. But current information-theoretic security approaches generally rely on an advantage of the channel of the desired recipient over the adversary, and such an advantage can be difficult to(More)