The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes

DOI10.1109/TIT.2016.2611527MaRDI QIDQ2976508zbMATH OpenFDO

Authors Victor G. L. Neumann, Cicero Carvalho

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: Projective Reed-Muller codes were introduced by Lachaud, in 1988 and their dimension and minimum distance were determined by Serre and S{o}rensen in 1991. In coding theory one is also interested in the higher Hamming weights, to study the code performance. Yet, not many values of the higher Hamming weights are known for these codes, not even the second lowest weight (also known as next-to-minimal weight) is completely determined. In this paper we determine all the values of the next-to-minimal weight for the binary projective Reed-Muller codes, which we show to be equal to the next-to-minimal weight of Reed-Muller codes in most, but not all, cases.

Cited in

(6)

• Minimum weight bases for quaternary Reed-Muller codes
• On the next-to-minimal weight of projective Reed-Muller codes
• Relative generalized Hamming weights of evaluation codes
• Towards the complete determination of next-to-minimal weights of projective Reed-Muller codes
• Area optimization for MPRM logic circuits based on improved multiple disturbances fireworks algorithm
• Bounds on the Pseudo-Weight of Minimal Pseudo-Codewords of Projective Geometry Codes

This page was built for publication: The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes

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