collaborators

1 paper

cs.IT2010

Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity

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…