Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes (Q2154892)

An important class of codes is quasi-twisted (QT) codes over fnite felds. They include cyclic codes, quasi-cyclic codes and constacyclic codes as special subclasses. These codes have been studied in detail recently. For example, there are structure results using Chinese Remainder Theorem, as in the case of quasi-cyclic codes over fnite felds. Self-dual codes over fnite felds are very interesting with many connections to other areas in mathematics. Linear codes with Complementary Duals (LCD) are related to self-dual codes as a kind of opposite extreme. They have very important applications to cryptography. The study of LCD codes dates back at least to a paper of \textit{J. L. Massey} [Discrete Math. 106/107, 337--342 (1992; Zbl 0754.94009)]. Double circulant codes form a special subclass of quasi-cyclic codes. Similarly doublenegacirculant codes form a special subclass of quasi-twisted codes. In [\textit{A. Alahmadi} et al., Discrete Appl. Math. 222, 205--212 (2017; Zbl 1437.94085); Des. Codes Cryptography 86, No. 6, 1257--1265 (2018; Zbl 1387.94126)] double circulant and double negacirculant codes over fnite felds were studied from the perspective of enumeration, which have asymptotic goodness consequences. In this paper the authors determine the unique factorization of some polynomials over a fnite local commutative ring with identity explicitly. This solves and generalizes the main conjecture of Qian, Shi and Solé in [\textit{L. Qian} et al., Cryptogr. Commun. 11, No. 4, 717--734 (2019; Zbl 1459.94170)]. They also give some applications to enumeration of certain generalized double circulant self-dual and linear complementary dual (LCD) codes over some fnite rings together with an application in asymptotic coding theory.