76 search results - page 4 / 16 » Random codes: Minimum distances and error exponents |
TIT
2010
13 years 2 months ago
2010
The error correction capability of binary linear codes with minimum distance decoding, in particular the number of correctable/uncorrectable errors, is investigated for general lin...
TIT
2008
13 years 7 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...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
TIT
2010
13 years 2 months ago
2010
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...