i have tried to understand it, but somehow didn't succeed.... can anybody tell me if the following code can be a private case of this code: say there are (2^m-m-1)*(2^n-n-1) information bits, we form them in a matrix, and for each row of the matrix (contains 2^m-m-1 bits) calculate m bits such that if you insert the whole row in a LFSR, you'll have all zeros in the register. do the same for the columns with n bits. after that add the last bit which is parity bit for the whole row/ column. hope i made myself clear.... and that someone will answer, thank you
Reed Muller error correction
Started by ●October 30, 2007