Representing GRM codes over finite rings

DOI10.1016/J.DISC.2025.114716MaRDI QIDQ6933573zbMATH OpenFDO

Authors Minjia Shi, Haodong Lu, Patrick Solé

Publication date 4 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114716

zbMATH Keywords

finite ringsGray maplinear codesgeneralized Reed-Muller codesmatrix product codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Other types of codes (94B60)

Cites work

• (1 + u) constacyclic and cyclic codes over \(F_{2} + uF_{2}\)
• A class of low-rate nonlinear binary codes
• A class of optimal \(p\)-ary codes from one-weight codes over \(\mathbb F_p[u]/\langle u^m\rangle\)
• All Reed-Muller codes are linearly representable over the ring of dual numbers over Z/sub 2/
• Boolean functions for cryptography and coding theory
• Codes and rings. Theory and practice
• Fundamentals of Error-Correcting Codes
• How Many Weights Can a Cyclic Code Have?
• Kerdock code in a cyclic form
• Matrix-product codes over \(\mathbb{F}_q\)
• New generalizations of the Reed-Muller codes--I: Primitive codes
• New generalizations of the Reed-Muller codes--II: Nonprimitive codes
• On $Z_p Z_{p^k}$ -Additive Codes and Their Duality
• On the Gray images of some constacyclic codes over F_p + u F_p + u^2 F_p
• The Reed-Muller code R(r,m) is not Z/sub 4/-linear for 3≤r≤m-2
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Z(p/sup k+1/)-linear codes

This page was built for publication: Representing GRM codes over finite rings

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