Minimal codewords in norm-trace codes

From MaRDI portal
Publication:6122425

DOI10.1007/S00010-023-00985-8arXiv2211.02329MaRDI QIDQ6122425FDOQ6122425

Matteo Bonini, Marco Timpanella, Daniele Bartoli

Publication date: 1 March 2024

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Abstract: In this paper, we consider the affine variety codes obtained evaluating the polynomials by=akxk+dots+a1x+a0, b,aiinmathbbFqr, at the affine Fqr-rational points of the Norm-Trace curve. In particular, we investigate the weight distribution and the set of minimal codewords. Our approach, which uses tools of algebraic geometry, is based on the study of the absolutely irreducibility of certain algebraic varieties.


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





Cites Work







This page was built for publication: Minimal codewords in norm-trace codes

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