We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
k < q/2
For RS FNT, the current decoding algorithm use FFT of length 2*k that should be less than q. Hence, the acceptable k must be smaller than half of q.
2*k
q
k
Source code: https://github.com/scality/quadiron/blob/master/src/fec_rs_fnt.h#L117
unsigned len_2k = this->gf->get_code_len_high_compo(2 * this->n_data); this->fft_2k = std::make_unique<fft::Radix2<T>>( *(this->gf), len_2k, len_2k, this->pkt_size);
The text was updated successfully, but these errors were encountered:
lamphamsy
No branches or pull requests
For RS FNT, the current decoding algorithm use FFT of length
2*k
that should be less thanq
. Hence, the acceptablek
must be smaller than half ofq
.Source code: https://github.com/scality/quadiron/blob/master/src/fec_rs_fnt.h#L117
The text was updated successfully, but these errors were encountered: