Recent progress on weight distributions of cyclic codes over finite fields

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. in coding theory it is often desirable to know the weight distribution of a cyclic code to estimate the error correcting capability and error probability. in this paper, we present the recent progress on the weight distributions of cyclic codes over finite fields, which had been determined by exponential sums. the cyclic codes with few weights which are very useful are discussed and their existence conditions are listed. furthermore, we discuss the more general case of constacyclic codes and give some equivalences to characterize their weight distributions.