Bose and Ray-Chaudhuri have recently described a class of binary codes which for arbitrary

and

are

-error correcting and have length

of which no more than

digits are redundancy. This paper describes a simple error-correction procedure for these codes. Their cyclic structure is demonstrated and methods of exploiting it to implement the coding and correction procedure using shift registers are outlined. Closer bounds on the number of redundancy digits are derived.