On the set of distances between two sets over finite fields

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)
6 Downloads (Pure)

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) ∈ A × ℬ for two given sets A, ℬ ∈ Fqn, where Fq is a finite field of q elements and n ≥ 1 is an integer.

Original languageEnglish
Article number59482
Pages (from-to)1-5
Number of pages5
JournalInternational Journal of Mathematics and Mathematical Sciences
Volume2006
DOIs
Publication statusPublished - 2006

Fingerprint

Dive into the research topics of 'On the set of distances between two sets over finite fields'. Together they form a unique fingerprint.

Cite this