Linear circulant matrices over a finite field. (Q1767231)

The author presents an exposition of some connections between following six constructions: polynomial ideals over finite fields [cf. \textit{S. Roman}, Coding and information theory (1992; Zbl 0752.94001)], linear cyclic codes [cf. \textit{J. Adámek}, Foundations of coding. Theory and applications of error-correcting codes with an introduction to cryptography and information theory (1991; Zbl 0747.94001)], linear difference equations [cf. \textit{N. Zierler}, J. Soc. Ind. Appl. Math. 7, 31--48 (1959; Zbl 0096.33804)], linear circular matrices [cf. \textit{A. T. Butson}, Can. J. Math. 15, 42--48 (1963; Zbl 0107.36201)], Butson-Hadamard matrices [cf. \textit{A. T. Butson}, Proc. Am. Math. Soc. 13, 894--898 (1963; Zbl 0109.24605)] over a multiplicative cyclic group, having in general complex elements, and generalized Hadamard matrices over an additive Abelian group [cf. \textit{W. Delauney}, Lect. Notes Math. 1036, 154--176 (1983; Zbl 0528.05010)]. Particularly, several remarks on linear cyclic codes are given, maximal linear codes in their connection with the prime ideals are constructed and some examples of circulant matrices are presented. As a result, many new inter-relationships are established.