8 search results - page 2 / 2 » Complexity of Decoding Positive-Rate Reed-Solomon Codes |
ICIP
1997
IEEE
14 years 6 months ago
1997
IEEE
Compressed images transmitted over noisy channels are extremely sensitive to bit errors. This necessitates the application of error control channel coding to the compressed repres...
ISCAS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Digital fountain codes are becoming increasingly important for multimedia communications over networks subject to packet erasures. These codes have significantly lower complex...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...