Learn More
— Non-systematic channel encoding can be superior to systematic encoding in the presence of redundancy in the transmitted data. We consider classes of non-systematic low-density parity-check (LDPC) codes based on scrambling or splitting redundant data bits into coded bits. Scrambling and splitting are achieved by cascading a sparse matrix or an inverse of a(More)
— We investigate the joint source-channel estimation and decoding problem. We consider a non-uniform binary source transmitted over a binary-input output-symmetric channel, namely the BEC, BSC and AWGN channels. The source sequence is encoded via systematic and non-systematic low-density parity-check codes. The proposed joint source-channel iterative(More)
In this paper, we discuss the principal pivot transforms (PPT) on a family of matrices, called the radix-2 DFT-type matrices. Given a transformation matrix, the PPT of the matrix is a transformation matrix with exchanging some entries between the input array and the output array. The radix-2 DFT-type matrices form a classification of matrices such that the(More)
—We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based Maximum-Likelihood decoder on the erasure channel and prob-abilistic Ordered Statistics Decoder on the Gaussian channel. As(More)
  • 1