In the "Simulation of a Reed-Solomon Block Code" example on the Tutorial page, the number of uncoded bits is calculated as k*NumCodeWords, where k=2^m-1-2*t and NumCodeWords is the number of codewords to simulate. Shouldn't the number of uncoded bits be m*k*NumCodeWords?
Regards,
/Andre
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Hello,
In the "Simulation of a Reed-Solomon Block Code" example on the Tutorial page, the number of uncoded bits is calculated as k*NumCodeWords, where k=2^m-1-2*t and NumCodeWords is the number of codewords to simulate. Shouldn't the number of uncoded bits be m*k*NumCodeWords?
Regards,
/Andre
Yepp. You are right. I have updated the example.
Thanks.
//Pl Frenger