Very easily decodable nonlinear cyclic codes

A class of nonlinear binary cyclic codes of length n=m2^m, constant weight w=m2^m-1, and minimum distance d_min=2^m, with M=n codewords for every m≥2 is introduced. The decoding computation is shown to be equivalent to performing two correlations of fixed sequences with the received word.