-
Notifications
You must be signed in to change notification settings - Fork 299
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
erasure_code_test can not support specific case #40
Comments
I don't think this is a bug but you are pushing the limits of a Vandermonde matrix. As described in the header for gf_gen_rs_matrix for k = 9 you are not guaranteed an invertable matrix unless m <= 13. You might consider using a different encoding matrix like a Cauchy-based one the example uses. You can test this will work with:
|
Thanks,yesterday I use Cauchy-based matrix, it does work |
There is a way to generate a systematic encoding matrix that is guaranteed to be invertible in any case. It works as follows: Step 1. Generate a K by K+M Vandermonde matrix The matrix resulting from step 4 can serve as an encoding matrix. The first K x K rows will correspond to the identity matrix. The remaining bottom M rows can serve the purposes of encoding redundancy. For reference, this is how the matrix is generated in other Reed-Solomon libraries, such as zfec: |
if k=9,m=18, and column in (0, 1, 2, 5, 7, 9, 10, 14, 16) corrupt, isa cannot decode
when execute example, report as follows:
erasure_code_test: 127x8192 BAD MATRIX
Fail to gf_gen_decode_matrix
The text was updated successfully, but these errors were encountered: