I am no expert either, but I just checked Wikipedia on Reed-Solomon codes [1]:
> By adding t check symbols to the data, a Reed–Solomon code can detect (but not correct) any combination of up to and including t erroneous symbols, OR locate and correct up to and including ⌊t/2⌋ erroneous symbols at unknown locations
So it looks like you would have to choose between, either:
A) correcting 6 bits OR
B) detecting 12 bit errors.
No?[1] https://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_cor...