Minimum Distance of New Generalizations of the Punctured Binary Reed-Muller Codes

05/27/2018

∙

by   Liqin Hu, et al.

∙

0

∙

share

Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al DLX introduced cyclic codes (q,m,h) and (q,m,h) over F_q as new generalization and version of the punctured binary Reed-Muller codes. In this paper, we show several new results on minimum distance of (q,m,h) and (q,m,h) which are generalization or improvement of previous results given in DLX.