夏良忠Hsia, Liang-Chung蔡東峻Tsai, Tung-Chun2025-12-092025-07-312025https://etds.lib.ntnu.edu.tw/thesis/detail/c65871db4feeca031b1973f29a5ab906/http://rportal.lib.ntnu.edu.tw/handle/20.500.12235/125506NoneLet p be an odd prime, and let H = ⟨-1,2⟩ be the multiplicative subgroup of Z_p^× generated by −1 and 2. Define l₀ = [Z_p^× ∶ H], the index of H in Z_p^×, and suppose that l₀ = 2q, where q is an odd prime. In this paper, we prove that there exists a generator g ∈ Z_p^× such that the diagonal equation 1+gx^(l₀ )=g^2 y^(l₀). has a solution over Zp. This equation plays a crucial role in the construction of optimal conflict-avoiding codes (optimal CACs) of length p and weight 3, which ensure collisionfree communication in time-slotted multiple-access systems. Our proof is based on the properties of Jacobi sums and cyclotomic numbers.noneConflict-avoiding codesDiagonal congruence equationsFinite fieldsJacobi sumsCyclotomic numbers學術論文