TIT
2002
13 years 11 months ago
2002
TIT
2002
13 years 11 months ago
2002
A code is -quasi-cyclic ( -QC) if there is an integer such that cyclic shift of a codeword by -positions is also a codeword. For = 1, cyclic codes are obtained. A dyadic code is a ...
TIT
2002
13 years 11 months ago
2002
This paper presents a unified approach to the problem of blind separation of sources, based on the concept of mutual information. This concept is applied to the whole source sequen...
TIT
2002
13 years 11 months ago
2002
TIT
2002
13 years 11 months ago
2002
Abstract-- This paper starts a systematic study of capacityachieving sequences of low-density parity-check codes for the erasure channel. We introduce a class Aof analytic function...
TIT
2002
13 years 11 months ago
2002
TIT
2002
13 years 11 months ago
2002
Abstract--A random matrix model is introduced that probabilistically describes the spatial and temporal multipath propagation between a transmitting and receiving antenna array wit...
TIT
2002
13 years 11 months ago
2002
TIT
2002
13 years 11 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
TIT
2002
13 years 11 months ago
2002
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...