The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes
From MaRDI portal
Publication:2976508
DOI10.1109/TIT.2016.2611527zbMath1359.94681arXiv1701.01658MaRDI QIDQ2976508
Victor G. L. Neumann, Cícero Fernandes de 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
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (4)
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
This page was built for publication: The Next-to-Minimal Weights of Binary Projective Reed–Muller Codes
