The minimum distance of new generalisations of the punctured binary Reed-Muller codes

DOI10.1007/S12095-019-00421-2MaRDI QIDQ2202917zbMATH OpenOpenAlexWikidataFDO

Authors Liqin Hu, Keqin Feng

Publication date 30 September 2020

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.10562

zbMATH Keywords

cyclic codegeneralized Reed-Muller codeReed-Muller code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Bounds on codes (94B65)

Abstract: Motivated by applications in combinatorial design theory and constructing LCD codes, C. Ding et al cite{DLX} introduced cyclic codes $mho(q,m,h)$ and $$ over $mathbb{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 $mho(q,m,h)$ and $$ which are generalization or improvement of previous results given in cite{DLX}.

Recommendations

• Another generalisation of the binary Reed-Muller codes and its applications
• On the Reed-Muller codes
• Minimum distance of relative Reed-Muller codes
• Generalized minimum distance functions
• New generalizations of the Reed-Muller codes--II: Nonprimitive codes

Cites work

• Another generalisation of the binary Reed-Muller codes and its applications
• scientific article; zbMATH DE number 1131801 (Why is no real title available?)
• New generalizations of the Reed-Muller codes--I: Primitive codes
• On generalized ReedMuller codes and their relatives

Cited in

(3)

• Another generalisation of the binary Reed-Muller codes and its applications
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Minimum distance of relative Reed-Muller codes

This page was built for publication: The minimum distance of new generalisations of the punctured binary Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202917)