Minimum Distance of New Generalizations of the Punctured Binary Reed-Muller Codes
Abstract
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 Fq 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.