On the set of distances between two sets over finite fields

Igor Shparlinski

doi:10.1155/IJMMS/2006/59482

On the set of distances between two sets over finite fields

Igor Shparlinski

School of Computing

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

14 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, ℬ ∈ F_qⁿ, where F_q is a finite field of q elements and n ≥ 1 is an integer.

Original language	English
Article number	59482
Pages (from-to)	1-5
Number of pages	5
Journal	International Journal of Mathematics and Mathematical Sciences
Volume	2006
DOIs	https://doi.org/10.1155/IJMMS/2006/59482
Publication status	Published - 2006

Access to Document

10.1155/IJMMS/2006/59482

Publisher version (open access).pdfFinal published version, 181 KB

Cite this

@article{5a5f9065941449a2a182a562da6187ae,

title = "On the set of distances between two sets over finite fields",

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.",

author = "Igor Shparlinski",

year = "2006",

doi = "10.1155/IJMMS/2006/59482",

language = "English",

volume = "2006",

pages = "1--5",

journal = "International Journal of Mathematics and Mathematical Sciences",

issn = "0161-1712",

publisher = "John Wiley & Sons",

}

TY - JOUR

T1 - On the set of distances between two sets over finite fields

AU - Shparlinski, Igor

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33749518709&partnerID=8YFLogxK

U2 - 10.1155/IJMMS/2006/59482

DO - 10.1155/IJMMS/2006/59482

M3 - Article

AN - SCOPUS:33749518709

SN - 0161-1712

VL - 2006

SP - 1

EP - 5

JO - International Journal of Mathematics and Mathematical Sciences

JF - International Journal of Mathematics and Mathematical Sciences

M1 - 59482

ER -

On the set of distances between two sets over finite fields

Abstract

Access to Document

Other files and links

Fingerprint

Cite this