60 search results - page 1 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
TIT
2008
13 years 4 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
FPGA
2006
ACM
13 years 8 months ago
2006
ACM
The development of Reed-Solomon (RS) codes has allowed for improved data transmission over a variety of communication media. Although Reed-Solomon decoding provides a powerful def...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract – Reed-Solomon (RS) codes are defined in several different ways which are not exactly equivalent. Distinct algorithms for encoding and decoding of RS codes have been dev...