Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity
Information Theory
2010-03-25 v1 math.IT
Abstract
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^{nRH(delta/R)}). The proposed algorithm inspects all error patterns in the information set of the received message of weight less than d/2 or d, respectively.
Cite
@article{arxiv.1003.4627,
title = {Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity},
author = {Dejan Spasov},
journal= {arXiv preprint arXiv:1003.4627},
year = {2010}
}