Abstract
We present an algorithm for computing Gauss sums over Fq for large prime powers q. This allows us to find the exact values of Gauss sums in many previously intractable cases. The efficient computation of such Gauss sums up to multiplication with a root of unity is achieved by using Stickelberger’s factorization of Gauss sums, an application of the Fincke-Pohst algorithm, and fast arithmetic for subfields of cyclotomic fields. This still leaves the crucial problem of resolving the root of unity ambiguity, which we settle by recursively computing “H-polynomials”. These are integer polynomials which interpolate Gauss sums at certain roots of unity. As an application, we compute the weight distribution of all binary irreducible cyclic codes of length n and dimension k with 2 k−1 n ≤ 5, 000. 2000 Mathematics Subject Classification: 11T24 (primary), 11Y40 (secondary)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
