Minimal codewords in Norm-Trace codes

Abstract

In this paper, we consider the affine variety codes obtained evaluating the polynomials $$by=a_kx^k+\ldots +a_1x+a_0$$ b y = a k x k + … + a 1 x + a 0 , $$b,a_i\in {\mathbb {F}}_{q^r}$$ b , a i ∈ F q r , at the affine $${{\mathbb {F}}}_{q^r}$$ 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 absolute irreducibility of certain algebraic varieties.