What algorithms are advised for soft-decoding of linear block codes (20,10) ? What are advised references ?
Sincerely Yours Alex
By soft-decoding - I mean that input - is set of 20 real numbers (r_1, ... r_20) and I want to find the codeword which is most close in the Eucledian metric to this vector. I can do brute force full search of all 2^10 codewords and find the nearest one - to get the answer. But I am interested in some speeding up the process. I've heard several methods, but advises are highly welcome.
PSPS My code is over F_2, e.g. 0,1, not the other Galois field