On codes in the projective linear group \(\mathrm{PGL}(2,q)\) (Q1979940)

Let \(G\) be a finite group and \(A\) be a nonempty proper subset of \(G\) satisfying the conditions that \(A\) does not contain the identity and \(A =\{g^{-1}: g\in A\}.\) The Cayley graph \(\mathrm{Cay}(G, A)\) is the simple undirected graph with vertex set \(G\) and edge set \(\{(g,h) : g^{-1}h\in A\}.\) Let \(\lambda\) be a natural number. \(A\) is said to divide \(\lambda G\) if there is a subset \(B\) of \(G\) such that the multiset \(\{a.b : a \in A, b\in B\}\) covers each element of \(G\) exactly \(\lambda\) times; the subset \(B\) is called a code with respect to \(A\) and it is written as \(A\cdot B =\lambda G.\) If \(\lambda = 1,\) then \(B\) is called a perfect code of \(\mathrm{Cay}(G, A)\). This notion of perfect codes generalizes the classical perfect codes in coding theory. When \(A\) is the union of conjugacy classes, it is of particular interest to study codes in \(\mathrm{Cay}(G, A)\). In this paper, authors resolve a conjecture of \textit{J. Chen} et al. [Discrete Math. 343, No. 5, Article ID 111813, 4 p. (2020; Zbl 1439.05104)] on codes in \(\mathrm{PGL}(2, q)\). To be specific, it is shown that: if \(D\) is a dihedral subgroup of order \(2(q+1)\) in \(G = \mathrm{PGL}(2, q),\) and \(A = \{g \in G : g^{q+1} = 1, g^2 \ne 1\},\) then \(\lambda G = A.D,\) where \(\lambda = q\) or \(q-1\) according as \(q\) is even or odd.