CORR
2004
Springer
14 years 10 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...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Title of dissertation: PERFORMANCE ANALYSIS OF ALGEBRAIC SOFT-DECISION DECODING OF REED-SOLOMON CODES Andrew Duggan, Masters of Science, 2006 Thesis directed by: Professor Alexand...
FFA
2008
14 years 10 months ago
2008
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
85
Voted
ASAP
2005
IEEE
15 years 6 days ago
2005
IEEE
Reed-Solomon codes are an important class of error correcting codes used in many applications related to communications and digital storage. The fundamental operations in Reed-Sol...
192
click to vote
CRYPTO
2000
Springer
15 years 1 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
67
Voted
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
83
Voted
ICIP
2004
IEEE
15 years 12 months ago
2004
IEEE
A novel scheme is proposed for the transmission of JPEG2000 image streams over wireless channels. The proposed scheme exploits the block-based coding structure of the JPEG2000 str...