Efficient Algorithms of Optimum Symbol-by-Symbol Decoding of Signals Corresponding to Linear Binary Codes

摘要

Algorithms of optimum symbol-by-symbol decoding of signals corresponding to linear binary codes are described. Implementation of these algorithms is based on the algorithm of fast spectral transform in the Walsh basis. It is shown that the dimension of the Walsh basis may be less than the dimension of the generator matrix or the dimension of the check matrix of the corresponding code.