Completing the determination of the next-to-minimal weights of affine cartesian codes

DOI10.1016/j.ffa.2020.101775zbMath1458.14039OpenAlexW3096243233MaRDI QIDQ1995210

Victor G. L. Neumann, Cícero Fernandes de Carvalho

Publication date: 19 February 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101775

zbMATH Keywords

higher Hamming weightsReed-Muller type codesnext-to-minimal weightsaffine cartesian codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Relative generalized Hamming weights of evaluation codes

Cites Work

• Unnamed Item
• Second weight codewords of generalized Reed-Muller codes
• On the next-to-minimal weight of affine Cartesian codes
• On the second weight of generalized Reed-Muller codes
• Weighted Reed-Muller codes revisited
• On the third weight of generalized Reed-Muller codes
• The second weight of generalized Reed-Muller codes in most cases
• Affine Cartesian codes
• On the second Hamming weight of some Reed-Muller type codes
• An Extension of Delsarte, Goethals and Mac Williams Theorem on Minimal Weight Codewords to a Class of Reed-Muller Type Codes
• New generalizations of the Reed-Muller codes--I: Primitive codes

This page was built for publication: Completing the determination of the next-to-minimal weights of affine cartesian codes