Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hatey, Valérian"'
We show that here standard decoding algorithms for generic linear codes over a finite field can speeded up by a factor which is essentially the size of the finite field by reducing it to a low weight codeword problem and working in the relevant proje
Externí odkaz:
http://arxiv.org/abs/2312.02607
