Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity
Date Issued
2010-09-12
Author(s)
Abstract
We show that for (systematic) linear codes the time
complexity of unique decoding is
2 nRH R 2/ O n q
and the time
complexity of minimum distance decoding is
2 nRH R O n q
.
The proposed algorithm inspects all error patterns in the
information set of the received message of weight less than
d 2
or d
, respectively.
