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

2018/05/27 by Hu, Liqin, Feng, Keqin
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1805.10562

Abstract

Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al \citeDLX introduced cyclic codes \mho(q,m,h) and \mho(q,m,h) over \mathbbF_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 \mho(q,m,h) and \mho(q,m,h) which are generalization or improvement of previous results given in \citeDLX.

Related

• Exact Minimum Distance of the Ding--Li--Xia Cyclic Codes
• A note on a gap in the proof of the minimum distance for Projective Reed-Muller Codes
• A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes
• Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
• Another Generalization of the Reed-Muller Codes