Celebratio Mathematica — Berlekamp

Complete Bibliography

Works connected to Jeffry L. Ramsey

Filter the Bibliography List

year	title	people

			clear

E. R. Berlekamp and J. L. Ramsey: “Readable erasures improve the performance of Reed–Solomon Codes,” IEEE Trans. Inform. Theory 24 : 5 (September 1978), pp. 632–633. article

Since well-known decoding algorithms [Fornery 1966; Berlekamp 1968] are able to correct both character errors and character erasures with \( q \)-ary Reed–Solomon codes, some modulation and demodulation schemes designed to be used with such codes provide a channel that has \( q \) inputs and \( q + 1 \) outputs, \( q \) of which correspond to the \( q \) inputs and one of which corresponds to the “erasure” symbol. This correspondence points om the relative advantages offered by a slightly more refined demodulation scheme, which creates a digital channel that has \( q \) inputs and \( 2_q \) outputs, \( q \) of which correspond to “strong” receptions of the inputs and \( q \) of which correspond to “weak” receptions of the inputs. For decoding purposes, all \( q \) weak outputs may be treated as erasures, but the fact that the channel now provides additional information facilitates improved decoding performance by reading the weak characters under the erasures.