This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
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...
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...
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...
Suman Mamidi, Daniel Iancu, Andrei Iancu, Michael ...
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...
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...
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...
Nikolaos Thomos, Nikolaos V. Boulgouris, Michael G...