On the set of distances between two sets over finite fields

Igor E. Shparlinski

International Journal of Mathematics and Mathematical Sciences, 2006, vol. 2006, 1-5

Abstract:

We use bounds of exponential sums to derive new lower bounds on the number of distinct distances between all pairs of points ( x , y ) ∈ × ℬ for two given sets , ℬ ∈ F q n , where F q is a finite field of q elements and n ≥ 1 is an integer.

Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2006/059482.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2006/059482.xml (text/xml)

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:hin:jijmms:059482

DOI: 10.1155/IJMMS/2006/59482

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().