Very easily decodable nonlinear cyclic codes
James L. Massey · 2003
A class of nonlinear binary cyclic codes of length n=m2/sup m/, constant weight w=m2/sup m-1/, and minimum distance d/sub min/=2/sup m/, with M=n codewords for every m/spl ges/2 is introduced. The decoding computation is shown to be equivalent to performing two correlations of fixed sequences with the received word.