On Apr 16, 10:34 am, David Joyner <[email protected]> wrote: > I think you meant to say "If the minimum distance is 9, then, I think, > only vectors with 4 > errors or less can be decoded correctly." I think erasures (where the > error positions are assumed to be known) are more complicated. > In the example of the last row, if you erase the first 8 0's then > the question is are there any other codewords which have > the same bits in the non-erased positions.
Yes, I meant errors. I didn't even think about the situation where the positions are known. In this case, the decoding seems to be rather simple - find 10 other columns with non-zero determinant of the matrix constructed from them, and use the inverse of this matrix for decoding. Alec -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
