Abstract: We propose an efficient algorithm to find a ReedSolomon (RS) codeword at a distance within the covering radius of the code from any point in its ambient Hamming space. To the best of the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback