
doi: 10.3934/math.2023783
<abstract><p>Let $ p\equiv 1\pmod 4 $ be a prime, $ m $ a positive integer, $ \frac{\phi(p^m)}2 $ the multiplicative order of $ 2 $ modulo $ p^m $, and let $ q = 2^{ \frac{\phi(p^m)}2} $, where $ \phi(\cdot) $ is the Euler's function. In this paper, we construct two classes of linear codes over $ \Bbb F_q $ and investigate their weight distributions. By calculating two classes of special exponential sums, the desired results are obtained.</p></abstract>
exponential sum, cyclotomy, two-weight code, QA1-939, linear code, Mathematics
exponential sum, cyclotomy, two-weight code, QA1-939, linear code, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
