Weight distribution of cyclic codes with arbitrary number of generalized Niho type zeroes with corrigendum

Abstract

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. Most previous results obtained so far were for cyclic codes with no more than three zeroes. Inspired by the works \cite{Li-Zeng-Hu} and \cite{gegeng2}, we study two families of cyclic codes over $\mathbb{F}_p$ with arbitrary number of zeroes of generalized Niho type, more precisely $\ca$ (for $p=2$) of $t+1$ zeroes, and $\cb$ (for any prime $p$) of $t$ zeroes for any $t$. We find that the first family has at most $(2t+1)$ non-zero weights, and the second has at most $2t$ non-zero weights. Their weight distribution are also determined in the paper.

The paper was published in Designs Codes Cryptogr., vol. 78, no. 3, pp. 713-730, 2016. Here in the last page we correct a mistake in the paper