DShambroom
01-27-2009, 06:01 PM
I believe the statement in the next-to-last paragraph on page 851:
"An (N,K) code can have d as large as N-K."
is incorrect. For example, a (15,11) code can have d=3, not 4.
A correct statement is:
"An (N,K) code can correct up to e bit errors, for the largest integer value of e that satisfies equation (16.2.2), with the equality relationship == replaced by the inequality <=. Such a code has d=2e+1."
Also, the last paragraph on page 852 is incorrect. Reed-Solomon codes have an alphabet of bytes, not bits, and an RS(28,24) code can correct considerably more that 2 bit errors.
"An (N,K) code can have d as large as N-K."
is incorrect. For example, a (15,11) code can have d=3, not 4.
A correct statement is:
"An (N,K) code can correct up to e bit errors, for the largest integer value of e that satisfies equation (16.2.2), with the equality relationship == replaced by the inequality <=. Such a code has d=2e+1."
Also, the last paragraph on page 852 is incorrect. Reed-Solomon codes have an alphabet of bytes, not bits, and an RS(28,24) code can correct considerably more that 2 bit errors.