Key points are not available for this paper at this time.
Bose and Ray-Chaudhuri have recently described a class of binary codes which for arbitrary m and t are t -error correcting and have length 2ᵐ - 1 of which no more than mt 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.
W. W. Peterson (Thu,) studied this question.