Distance Distribution to Received Words in Reed-Solomon Codes
share
n this paper, we obtain an asymptotic formula for the number of codewords with a fixed distance to a given received word of degree k+m in the standard Reed-Solomon code [q, k, q-k+1]_q. Previously, explicit formulas were known only for the cases m=0, 1, 2.
READ FULL TEXT