Few-weight linear codes over $\mathbb{F}_p$ from $t$-to-one mappings

ePrint Report: Few-weight linear codes over $\mathbb{F}_p$ from $t$-to-one mappings

René Rodríguez-Aldama

For any prime number $p$, we provide two classes of linear codes with few weights over a $p$-ary alphabet. These codes are based on a well-known generic construction (the defining-set method), stemming on a class of monomials and a class of trinomials over finite fields. The considered monomials are Dembowski-Ostrom monomials $x^{p^{\alpha}+1}$, for a suitable choice of the exponent $\alpha$, so that, when $p>2$ and $n\not\equiv 0 \pmod{4}$, …

alphabet class construction eprint report linear prime report well-known