Very easily decodable nonlinear cyclic codes
A class of nonlinear binary cyclic codes of length n=m2m, constant weight w=m2m-1, and minimum distance dmin=2m, 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
