the combination of these factors means that good crc polynomials are often primitive polynomials (which have the best 2-bit error detection) or primitive polynomials of degree formula_98, multiplied by formula_26 (which detects all odd numbers of bit errors, and has half the two-bit error detection ability of a primitive polynomial of degree formula_2).