We extend the idea of classical cyclic redundancy check codes to quantum
cyclic redundancy check codes. This allows us to construct codes quantum
stabiliser codes which can correct burst errors where the burst length attains
the quantum Reiger bound. We then consider a certain family of quantum cyclic
redundancy check codes for which we present a fast linear time decoding
algorithm