Structural properties and enumeration of 1-generator generalized quasi-cyclic codes (Q540476): Difference between revisions

This paper deals with structural properties of Generalized Quasi-Cyclic codes (GQC-codes) and the enumeration of 1-generator GQC-codes. The work presented is motivated by earlier results on structural properties and enumeration of Quasi-Cyclic codes (QC-codes). QC-codes are known to be asymptotically good and for given lenth and dimension in a lot of cases there are QC-codes realizing the best minimal distance for linear codes. The author is able to show that GQC-codes can be uniquely (up to isomorphism) decomposed as a product of \(\text{GF}(q)[x]\)-submodules (Theorem 3.3). Based on this result he is able to enumerate 1-generator GQC-codes (Theorem 3.4). He gives an algorithm for computing the number of 1-generator GQC-codes, and finally illustrates the algorithm for a specific example of parameters. The index l in the last bullet below Lemma 2.2 is clearly a misprint, it has to be a 2. Furthermore, the notation \( \{r_{1k}^{n_{1k}},\dots,r_{t_kk}^{n_{t_kk}}\}\) in Theorem 3.3 and Step 4 of the algorithm is somewhat confusing, it is supposed to mean the multiset consisting of \( n_{ik} \) copies of \( r_{ik} \) for \( i=1,\dots,t_k \). The results are not presented in an easily accessible way, but a persistent reader can work through the paper (especially working out his own example while reading).