TIT
2008
13 years 4 months ago
2008
The classical Blahut
TIT
2008
13 years 4 months ago
2008
Abstract--In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the ...
TIT
2008
13 years 4 months ago
2008
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
TIT
2008
13 years 4 months ago
2008
TIT
2008
13 years 4 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
TIT
2008
13 years 4 months ago
2008
In the past few years, a certain number of authors have proposed analysis methods of the time series built from a long range dependence noise. One of these methods is the Detrended...
TIT
2008
13 years 4 months ago
2008
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
TIT
2008
13 years 4 months ago
2008
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operat...
TIT
2008
13 years 4 months ago
2008
Progressive encoding of a signal generally involves an estimation step, designed to reduce the entropy of the residual of an observation over the entropy of the observation itself....
TIT
2008
13 years 4 months ago
2008
