The average binary expansion of a Reed-Solomon code is good for error detection
CHARLES T. RETTER · 2002
When different bases are used to expand different columns of any Reed-Solomon code, the average error-detecting performance of the resulting binary codes is a monotonic function of the bit error probability.