arXiv:2611.24769v1 Announce Type: new Abstract: Let $n$ be a composite positive integer coprime to $\operatorname{char}(\mathbb{F}_q)$ and let $t = \operatorname{lpf}(n)$ be the least prime factor of $n$. In this paper we study the cyclic codes $\mathcal{C}_{n,t} = \langle Q_n(X)Q_t(X)\rangle$ and $\mathcal{C}_{n,t,1} = \langle Q_n(X)Q_t(X)Q_1(X)\rangle$ over $\mathbb{F}_q$, where $Q_d(X)$ denotes the $d$-th cyclotomic polynomial. These codes extend the families $\mathcal{C}_n = \langle Q_n(X)\rangle$ and $\mathcal{C}_{n,1} = \langle Q_n(X)Q_1(X)\rangle$ recently studied by Bhagat and Sarma. We determine the exact minimum distances of $\mathcal{C}_{n,t}$ and $\mathcal{C}_{n,t,1}$, showing that $d(\mathcal{C}_{n,t,1}) = 2t$ and that $d(\mathcal{C}_{n,t})$ equals $t$ if $t^2 \nmid n$, and $2t$ if $t^2 \mid n$. For the dual codes, we establish $d(\mathcal{C}_{n,t}^\perp) = 2^{\omega(n)}$, handling the case $\omega(n) \le 2$ via the Hartmann--Tzeng bound, and the case $\omega(n) \ge 3$ via a direct-sum decomposition $\mathcal{C}_{n,t}^\perp = \mathcal{C}_n^\perp \oplus \mathcal{V}_t$ and the tensor-product structure of $\mathcal{C}_n^\perp$ over its prime-power components. As applications, we show that all four code families are linear complementary dual (LCD) and locally recoverable (LRC), and we determine their locality parameters, identifying several infinite families that are $r$-optimal or $d$-optimal with respect to the Singleton-type bound for LRC codes.