Cyclic Redundancy Check

A sophisticated Checksum (often abbreviated CRC), which is based on the algebra of polynomials over theintegers (mod 2). It is substantially more reliable in detecting transmission errors, and is one common error-checkingprotocol used in modems.

References

Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. ``Cyclic Redundancy and Other Checksums.'' Ch. 20.3 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 888-895, 1992.

• Schaar's Identity
• Schanuel's Conjecture
• Schauder Fixed Point Theorem
• Scheme
• Schensted Correspondence
• Scherk's Minimal Surfaces
• Schiffler Point
• Schinzel Circle
• Schinzel's Hypothesis
• Schinzel's Theorem
• Schisma
• Schlegel Graph
• Schläfli Double Six
• Schläfli Function
• Schläfli Integral
• Schläfli Polynomial
• Schläfli's Formula
• Schläfli's Modular Form
• Schläfli Symbol
• Schlömilch's Function
• Schlömilch's Series
• Schmitt-Conway Biprism
• Schnirelmann Constant
• Schnirelmann Density
• Schnirelmann's Theorem