Error detection using Reed-Solomon method

Hello ,

I am trying to use Reed-Solomon method for encode some messages. Then, I corrupt some of the messages and give it to the function :

decode_i=gf(I,m);
[i_math,CNUMERR_i,CCODE_i]=rsdec(decode_i,n,k);

to decode it. However, for my application, I am just looking at the detection capability of Reed-Solomon. Based on the literature that I have seen, Reed-Solomon code can correct up to r=n-k errors where n is the length of the message and k is number of the main message before adding the control digits.

My question is that how can use the abovementioned function for evaluating detetability of Reed-Solomon . Is it right to say that whenever CNUMERR_i equal to -1 or positive, an error is detected?

I do some experiments and see that using my solution Reed-Solomon is achieving a very high detectability which not matchs the theory. I would appreciate you very much if you help me with this confusion.

[Paúl Llerena]

Hi, I have the same problem. Do you solved it?