Minimal codewords in norm-trace codes

DOI10.1007/S00010-023-00985-8MaRDI QIDQ6122425zbMATH OpenFDO

Authors Daniele Bartoli, Matteo Bonini, Marco Timpanella

Publication date 1 March 2024

Published in Aequationes Mathematicae (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

minimal codewordsaffine variety codesweight spectrumnorm-trace curve

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this paper, we consider the affine variety codes obtained evaluating the polynomials $by=a_k{x}^k+dots+a_{1}x+a_0$, $b,a_{i}inmathbb{F}_{q^r}$, at the affine $F_{q^r}$-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.

Recommendations

• On codes from norm-trace curves
• On the duals of geometric Goppa codes from norm-trace curves
• Decreasing norm-trace codes
• Intersections between the norm-trace curve and some low degree curves
• scientific article; zbMATH DE number 5880444

Cites work

• scientific article; zbMATH DE number 1944645 (Why is no real title available?)
• scientific article; zbMATH DE number 1941572 (Why is no real title available?)
• scientific article; zbMATH DE number 2168577 (Why is no real title available?)
• AG codes and AG quantum codes from cyclic extensions of the Suzuki and Ree curves
• An inductive construction of minimal codes
• Codes and Gap Sequences of Hermitian Curves
• Codes with locality from cyclic extensions of Deligne-Lusztig curves
• Decoding affine variety codes using Gröbner bases
• Improved explicit estimates on the number of solutions of equations over a finite field
• Intersections between the norm-trace curve and some low degree curves
• Linear cutting blocking sets and minimal codes in the rank metric
• Locally recoverable codes from algebraic curves and surfaces
• Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve
• Number of Points of Varieties in Finite Fields
• On One-Dimensional Linear Minimal Codes Over Finite (Commutative) Rings
• On codes from norm-trace curves
• On cutting blocking sets and their codes
• On the duals of geometric Goppa codes from norm-trace curves
• On the intersection pattern of a unital and an oval in \(PG(2,q^{2})\)
• On the small-weight codewords of some Hermitian codes
• On the weight distribution of some minimal codes
• Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
• Small Strong Blocking Sets by Concatenation
• The dual minimum distance of arbitrary-dimensional algebraic-geometric codes
• Three combinatorial perspectives on minimal codes

Cited in

(1)

• Decreasing norm-trace codes

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)