We show how to construct an algorithm to search for binary idempotents which may be used to construct binary LDPC codes. The algorithm, which allows control of the key properties of sparseness, code rate and minimum distance, is constructed in the Mattson-Solomon domain. Some of the new codes, found by using this technique, are displayed.
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the extended quadratic residue is completely determined once the number of codewords of Hamming weight j Aj, for 0 ≤ j ≤… (More)
—In this paper, we consider the primary user detection problem in cognitive radio systems by using multi antenna at the cognitive radio receiver. An optimal linear combiner multi antenna based spectrum sensing technique is proposed using the multitaper spectrum estimation method. A suboptimal square law combiner multi antenna based technique, using the… (More)