8 citations · 8 across the 4 of their papers we have counts for
1 paper · 1 filter
Dejan Spasov
We show that for (systematic) linear codes the time complexity of unique decoding is O(n^{2}q^{nRH(delta/2/R)}) and the time complexity of minimum distance decoding is O(n^{2}q^{nR…