Permutation decoding of certain triple-error-correcting binary codes (Corresp.)

In a recent note [1] an analysis of certain binary double-error-correcting cyclic codes was made from the point of view of permutation decodability. Specifically, upper bounds on the rates of these codes were established so that the codes would be permutation decodable. The object of the present correspondence is to give corresponding results for binary triple-error-correcting cyclic codes of certain lengths.