𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial problems in finite fields and Sidon sets

✍ Scribed by Javier Cilleruelo

Book ID
118786699
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
219 KB
Volume
32
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A combinatorial problem for vector space
A combinatorial problem for vector spaces over finite fields
✍ Harald Niederreiter πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 767 KB

We study a combinatorial problem for vector spaces over finite fields which generalizes the following classical problem in algebraic coding theory: given a finite field Fq and integers n > k 2 1, find the largest minimum distance that can be achieved by a linear code over Fq with fixed length n and

Large sets in finite fields are sumsets
Large sets in finite fields are sumsets
✍ Noga Alon πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 132 KB

For a prime p, a subset S of Z p is a sumset if S = A+A for some A βŠ‚ Z p . Let f (p) denote the maximum integer so that every subset S βŠ‚ Z p of size at least pf (p) is a sumset. The question of determining or estimating f (p) was raised by Green. He showed that for all sufficiently large p, f (p) 1