. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 CHAPTER

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

This paper presents a construction of very high-rate low-density parity-check (LDPC) codes based on the incidence matrices of unital designs. Like the projective geometry and oval designs, unital designs exist with incidence matrices which are significantly rank deficient. Thus high-rate LDPC codes with a large number of linearly dependent parity-check equations can be constructed. The LDPC cod...

In this paper we construct a class of regular Low Density Parity Check (LDPC) codes derived from Latin squares. The parity check matrices of these codes are constructed by permuting shift-orthogonal Latin squares of order n in blockrows and block-columns. I show that the constructed LDPC codes are self-orthogonal and their minimum and stopping distances are bounded. This helps us to construct a...

Continuous-variable quantum key distribution utilizes an ensemble of coherent states light to distribute secret encryption keys between two parties. One the challenges is thereby requirement capacity approaching error correcting codes in low signal-to-noise (SNR) regime (SNR < 0 dB). Multilevel coding (MLC) combined with multistage decoding (MSD) can solve this challenge combination multi-edge-...