Summary: Let \(G\) be a connected graph of size at least 2 and \(c :E(G)\to\{0, 1,\dots, k- 1\}\) an edge coloring (or labeling) of \(G\) using \(k\) labels, where adjacent edges may be assigned the same label. For each vertex \(v\) of \(G\), the color code of \(v\) with respect to \(c\) is the \(k\)-vector code\((v) = (a_{0}, a_{1},\dots, a_{k-1})\), where \(a_i\) is the number of edges incident with \(v\) that are labeled \(i\) for \(0 \leq i \leq k - 1\). The labeling \(c\) is called a detectable labeling if distinct vertices in \(G\) have distinct color codes. The value \(\mathrm{val}(c)\) of a detectable labeling \(c\) of a graph \(G\) is the sum of the labels assigned to the edges in \(G\). The total detection number \(\mathrm{td}(G)\) of \(G\) is defined by \(\mathrm{td}(G) = \min\{\mathrm{val}(c)\}\), where the minimum is taken over all detectable labelings \(c\) of \(G\). We investigate the problem of determining the total detection numbers of cycles.