Bound for mixed exponential sums associated to binary good cyclic codes
From MaRDI portal
Publication:2422197
DOI10.1016/j.ffa.2019.04.007zbMath1446.11209OpenAlexW2945810839WikidataQ115575254 ScholiaQ115575254MaRDI QIDQ2422197
R. Arce-Nazario, Braulio Molina, Francis N. Castro
Publication date: 18 June 2019
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2019.04.007
Exponential sums (11T23) Trigonometric and exponential sums (general theory) (11L03) Cyclic codes (94B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using Stepanov's method for exponential sums involving rational functions
- On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}
- Divisibility properties for covering radius of certain cyclic codes
- Mixed exponential sums over finite fields
- A further refinement of Mordell's bound on exponential sums
- On the minimum distance of cyclic codes
- An improved Mordell type bound for exponential sums
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- On Some Exponential Sums