Shengtian Yang

Learn More
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields. By using this tool, we analyze the performance of SW codes based on LDPC codes and random permutations, and show that under some conditions, all but a diminishingly small proportion(More)
The average weight distribution of a regular low-density parity-check (LDPC) code ensemble over a finite field is thoroughly analyzed. In particular, a precise asymptotic approximation of the average weight distribution is derived for the small-weight case, and a series of fundamental qualitative properties of the asymptotic growth rate of the average(More)
In the authors' former work, it was proved by the code-spectrum approach that linear codes with good joint spectra serve as good candidates for lossless joint source channel coding (JSCC). However, it is still unknown how to construct such codes in practice. This paper aims to present some methods for constructing linear codes with good joint spectra, and(More)
The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random matrices, is studied. It is shown that a k-good random m-by-n matrix with a distribution of minimum support size is(More)
We think about the problem of reliable transmission of information over AWGN channels using rateless codes. We introduce a new family of rateless codes, named the accumulate rateless (AR) codes, which is easy to construct as traditional LT codes but has better performance and lower complexity. We investigate the performance of AR codes over AWGN channels,(More)
A general lossless joint source-channel coding scheme based on linear codes is proposed and then analyzed in this paper. It is shown that a linear code with good joint spectrum can be used to establish limit-approaching joint source-channel coding schemes for arbitrary sources and channels, where the joint spectrum of the code is a generalization of the(More)
Linear encoders with good joint spectra are suitable candidates for optimal lossless joint source-channel coding (JSCC), where the joint spectrum is a variant of the input-output complete weight distribution and is considered good if it is close to the average joint spectrum of all linear encoders (of the same coding rate). In spite of their existence,(More)
The problem of finding good linear codes for joint source-channel coding (JSCC) is investigated in this paper. By the code-spectrum approach, it has been proved in the authors' previous paper that a good linear code for the authors' JSCC scheme is a code with a good joint spectrum, so the main task in this paper is to construct linear codes with good joint(More)
A general lossless joint source-channel coding scheme based on linear codes and random interleavers for multiple-access channels is presented and then analyzed in this paper. By the information-spectrum approach and the code-spectrum approach, it is shown that a linear code with good joint spectrum can be used to establish limit-approaching joint(More)