𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial designs and the theorem of Weil on multiplicative character sums

✍ Scribed by Marco Buratti; Anita Pasotti

Book ID
108131481
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
219 KB
Volume
15
Category
Article
ISSN
1071-5797

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On character sums and the exceptional se
On character sums and the exceptional set of a congruence problem
✍ M.Z. Garaev; A.A. Karatsuba πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 184 KB

We prove an estimate of character sums. This bound and the method of solving multiplicative ternary problems are used to obtain new results about the cardinality of an exceptional set of a congruence problem modulo a prime p. In particular, we show that "almost all" residue classes modulo p are repr

On the equivalence of certain constant w
On the equivalence of certain constant weight codes and combinatorial designs
✍ Victor A. Zinoviev πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 266 KB

## Stinson and van Rees (Combinatorica (1984), 357-362) proved that the existence of an equidistant code E: (n = 4s + 1,d = 2s, N) with N = n implies the existence of a certain symmetrical BIB design. This result is extended here for the constant weight codes with the same n and d. A theorem on t