Combinatorial designs and the theorem of Weil on multiplicative character sums
From MaRDI portal
Publication:1017416
DOI10.1016/j.ffa.2008.12.007zbMath1211.05022OpenAlexW1988036966MaRDI QIDQ1017416
Publication date: 19 May 2009
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2008.12.007
difference familygraph-decompositionconsistent \(k\)-choiceWeil's theorem on multiplicative character sums
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (42)
Improving the existence bounds for grid-block difference families ⋮ Cyclic balanced sampling plans excluding contiguous units with block size four ⋮ Combinatorial constructions for maximum optical orthogonal signature pattern codes ⋮ Partitioned difference families and harmonious linear spaces ⋮ Difference sets in pseudocyclic association schemes ⋮ Constructions for optimal \((u\times v,\{3,4\},1,Q)\)-OOSPCs ⋮ Grid-block difference families and related combinatorial structures ⋮ A new series of main effects plus one plan for \(2^m\) factorial experiments with \(m=4\lambda \pm 1\) and \(2m\) runs ⋮ Difference systems of sets with size 2 ⋮ Existence of strong difference families and constructions for eight new 2‐designs ⋮ New 2-designs from strong difference families ⋮ New results on optimal \((v,4,2,1)\) optical orthogonal codes ⋮ A generalization of Heffter arrays ⋮ On optimal (Z6m×Z6n,4,1) and (Z2m×Z18n,4,1) difference packings and their related codes ⋮ Graph decompositions in projective geometries ⋮ On optimal \((v,5,2,1)\) optical orthogonal codes ⋮ Further results on balanced \((n, \{3, 4 \}, \Lambda_a, 1)\)-OOCs ⋮ Bounds and constructions for multilength variable-weight optical orthogonal codes ⋮ Further results on optimal \((v,4,2,1)\)-OOCs ⋮ On minimum size blocking sets of the outer tangents to a hyperbolic quadric in \(\operatorname{PG}(3, q)\) ⋮ Fano kaleidoscopes and their generalizations ⋮ Bounds and constructions for optimal \((n, \{3, 5 \}, \varLambda_a, 1, Q)\)-OOCs ⋮ Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes ⋮ The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class ⋮ Semi-cyclic holey group divisible designs with block size three ⋮ Constructions of \((q,K,\lambda, t,Q)\) almost difference families ⋮ Some 20-regular CDP(5,1;20\(u\)) and their applications ⋮ Further progress on difference families with block size 4 or 5 ⋮ Constructions for cyclic Moebius ladder systems ⋮ Necessary conditions and frame constructions for \(\mathbb Z\)-cyclic patterned starter whist tournaments ⋮ On silver and golden optical orthogonal codes ⋮ Note on a construction of short \(k\)-radius sequences ⋮ Some series of optimal multilength OOCs of weight four ⋮ Frame difference families and resolvable balanced incomplete block designs ⋮ Strong difference families, difference covers, and their applications for relative difference families ⋮ Strong difference families of special types ⋮ Novák's conjecture on cyclic Steiner triple systems and its generalization ⋮ Hadamard partitioned difference families and their descendants ⋮ Existence of simple BIBDs from a prime power difference family with minimum index ⋮ Super-regular Steiner 2-designs ⋮ Compatible difference packing set systems and their applications to multilength variable-weight OOCs ⋮ A characterization of the family of secant lines to a hyperbolic quadric in \(\mathrm{PG}(3,q)\), \(q\) odd. II
Cites Work
- Existence of \(V(m,t)\) vectors
- Cyclotomic numbers and a conjecture of Snapper
- On the maximal number of pairwise orthogonal Steiner triple systems
- Existence of \((q,6,1)\) difference families with \(q\) a prime power
- On cyclically resolvable cyclic Steiner 2-designs
- Existence of APAV\((q,k)\) with \(q\) a prime power \(\equiv 5 \pmod 8\) and \(k\equiv 1 \pmod 4\).
- \(V (m, t)\)'s for \(m = 4, 5, 6\)
- Existence of \(Z\)-cyclic triplewhist tournaments for a prime number of players
- Cyclic designs with block size 4 and related optimal optical orthogonal codes
- Some progress on \((v,4,1)\) difference families and optical orthogonal codes
- An existence theorem for cyclic triplewhist tournaments
- Cyclotomy and difference families in elementary Abelian groups
- Optimal (9v, 4, 1) Optical Orthogonal Codes
- Strong difference families over arbitrary graphs
- Existence of (q, 7, 1) difference families with q a prime power
- Constructions of optimal optical orthogonal codes with weight five
- Combinatorial constructions of optimal optical orthogonal codes with weight 4
- Cyclically resolvable designs and triple whist tournaments
- \(V(m,t)\) and its variants
- Generalized Steiner systems GS\((2,4,\nu,2)\) with \(\nu\) a prime power \(\equiv 7\pmod{12}\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial designs and the theorem of Weil on multiplicative character sums
