On Some Features of Linear Cyclic Codes

We obtain lower bounds for the code distance of a linear cyclic code with an irreducible check polynomial and a new upper bound for correlation functions (both periodic and aperiodic) of two arbitrary $m$-sequences. Also, we construct an infinite family of linear cyclic codes with better parameters than those of BCH codes.