On the set of distances between two sets over finite fields
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 ,ℬ∈Fqn, where Fq is a finite field of q elements and n≥1 is an integer.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2006-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/IJMMS/2006/59482 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|