Abstract
Upper bounds for certain exponential sums over Galois rings are presented. The bound may be regarded as the Galois ring analogue of the so called Kloosterman sums and related exponential sums with a Laurent polynomial argument. An application of the bounds to the design of large families of polyphase sequences with good correlation properties is also given. The character sums appear naturally as correlation values of certain families of sequences. To arrive at the families all one has to do is to select representatives of cyclically distinct classes of associated codewords.
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.
