Andere Kunden interessierten sich auch für
![Cryptography, Information Theory, and Error-Correction]( "Cryptography, Information Theory, and Error-Correction")
Cryptography, Information Theory, and Error-Correction148,99 €![Symmetric Mean Absolute Percentage Error]( "Symmetric Mean Absolute Percentage Error")
Symmetric Mean Absolute Percentage Error22,99 €![Reed Muller Code]( "Reed Muller Code")
Reed Muller Code19,99 €![Round-off Error]( "Round-off Error")
Round-off Error22,99 €![Standard Error (statistics)]( "Standard Error (statistics)")
Standard Error (statistics)29,99 €![Linear Error-Block Codes and Applications]( "Linear Error-Block Codes and Applications")
Linear Error-Block Codes and Applications46,99 €![Galois rings and generalized Reed-Muller codes]( "Galois rings and generalized Reed-Muller codes")
Galois rings and generalized Reed-Muller codes19,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In coding theory, Reed Solomon (RS) codes are non-binary cyclic error-correcting codes invented by Irving S. Reed and Gustave Solomon. They described a systematic way of building codes that could detect and correct multiple random symbol errors. By adding t check symbols to the data, an RS code can detect any combination of up to t erroneous symbols, and correct up to t/2 symbols. As an erasure code, it can correct up to t known erasures, or it can detect and correct combinations of errors and erasures. Furthermore, RS codes are suitable as multiple-burst bit-error correcting codes, since a sequence of b+1 consecutive bit errors can affect at most two symbols of size b.