Titlebook: Error-Correction Coding for Digital Communications; George C. Clark,J. Bibb Cain Book 1981 Springer Science+Business Media New York 1981 C

Devastate

OMIT

Cantankerous

Fundamental Concepts of Coding,ishes an error rate above which the received data are not usable. If the received data will not meet the error rate requirement, error-correction coding can often be used to reduce errors to a level at which they can be tolerated. In recent years the use of error-correction coding for solving this type of problem has become widespread.

Biguanides

刺耳

refine

Allergic

https://doi.org/10.1007/978-3-030-40578-6s of practical importance. They are often referred to by other names such as linear codes or generalized parity check codes. Within the set of all group codes there is a second major subdivision called polynomial generated codes. Examples of polynomial generated codes are the Bose-ChaudhuriHocquengh

mydriatic

A Spacecraft that can Think for Itself, the simultaneous solution of sets of equations for the location and values of the errors. The nonalgebraic techniques, while accomplishing the same goal, are based upon simple structural aspects of the codes which permit one to determine the error patterns in a more direct fashion. In this chapter

儀式

公共汽車(chē)

Genetic Signatures of Centenarians,ch has produced a number of practical decoding techniques for these codes, and the theory is quite well developed. It is the algebraic structure imposed on these codes that has allowed computationally efficient decoding algorithms to be developed. We shall present several of these techniques, but th