Comparison of Techniques on Divisibility Properties of Exponential Sums and Applications

Oscar Moreno and Francis N. Castro
Additional contact information
Oscar Moreno: University of Puerto Rico, Mathematics Department
Francis N. Castro: University of Puerto Rico, Mathematics Department

A chapter in Finite Fields and Applications, 2001, pp 363-389 from Springer

Abstract: Abstract We give an exposition of the present day methods to obtain the divisibility properties of exponential sums. Also we compare the methods and evaluate their performance with respect to the to bound the exponential sums and the minimum distance of cyclic codes. Finally, we give some new results applying the packing method in order to improve the divisibility properties of certain families of exponential sums and cyclic codes.

Keywords: Finite Field; Code Word; Cyclic Code; Minimal Covering; Newton Polyhedron (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-56755-1_29

Ordering information: This item can be ordered from
http://www.springer.com/9783642567551

DOI: 10.1007/978-3-642-56755-1_29

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().