Skip to content
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

[FNT] Decoding algorithm requires k < q/2 #286

Open
lamphamsy opened this issue Jun 18, 2019 · 0 comments
Open

[FNT] Decoding algorithm requires k < q/2 #286

lamphamsy opened this issue Jun 18, 2019 · 0 comments
Assignees

Comments

@lamphamsy
Copy link
Contributor

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.

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);
@lamphamsy lamphamsy self-assigned this Jun 18, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant