Cyclotomy and difference families in elementary Abelian groups
From MaRDI portal
Publication:2560249
Cites work
- A Note on Balanced Incomplete Block Designs
- Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
- scientific article; zbMATH DE number 3173758 (Why is no real title available?)
- scientific article; zbMATH DE number 3207391 (Why is no real title available?)
- scientific article; zbMATH DE number 3252237 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- On balanced incomplete block designs with blocks having five elements
- On Residue Difference Sets
- On Some Methods for Construction of B.I.B. Designs
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
- The Existence and Construction of Balanced Incomplete Block Designs
Cited in
(only showing first 100 items - show all)- A class of optimal constant composition codes from GDRPs
- Strong difference families, difference covers, and their applications for relative difference families
- Generalizations of partial difference sets from cyclotomy to nonelementary Abelian \(p\)-groups
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Near generalized balanced tournament designs with block sizes 4 and 5
- The family of t-designs. Part I
- Difference families from rings
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- On the existence of certain cyclic difference families and difference matrices
- A method of constructing generalized difference sets
- On the maximal number of pairwise orthogonal Steiner triple systems
- Balanced incomplete block designs and related designs
- Perfect cyclic designs
- Composition theorems for difference families and regular planes
- On cyclically resolvable cyclic Steiner 2-designs
- Cyclotomic schemes over finite, commutative, admissible rings
- Bimatching designs
- A powerful method for constructing difference families and optimal optical orthogonal codes
- Optimal constant weight codes over \(Z_k\) and generalized designs
- Cyclic orthogonal and balanced arrays
- Edge decomposition of complete tripartite graphs
- V (m, t)'s for m = 4, 5, 6
- Two new classes of difference families
- Some combinatorial constructions for optical orthogonal codes
- The existence of resolvable BIBD with \(\lambda=1\)
- Hypergraphs, quasi-randomness, and conditions for regularity
- New 2-designs from strong difference families
- On the existence of balanced incomplete block designs with nested rows and columns
- Recursive constructions for cyclic BIB designs and their generalizations
- On existence and construction of balanced arrays
- Constructions of \((q,k,1)\) difference families with \(q\) a prime power and \(k=4,5\)
- Construction of \(E(s^2)\)-optimal supersaturated designs
- Concerning the vector \(v(m,t)\)
- Upper bounds on cyclotomic numbers
- Decompositions of edge-colored complete graphs
- Strong external difference families in abelian and non-abelian groups
- A lower bound on HMOLS with equal sized holes
- Super-regular Steiner 2-designs
- Internal and external partial difference families and cyclotomy
- Three classes of partitioned difference families and their optimal constant composition codes
- Bounds and constructions for multilength variable-weight optical orthogonal codes
- Constructions of \((q,K,\lambda, t,Q)\) almost difference families
- Pooling design and bias correction in DNA library screening
- Zero-difference balanced functions with applications
- Almost designs and their links with balanced incomplete block designs
- Partitioned difference families versus zero-difference balanced functions
- Partial geometric designs from group actions
- Improving the existence bounds for grid-block difference families
- A note on difference families from cyclotomy
- Near-complete external difference families
- Existence and non-existence results for strong external difference families
- Constructions for optimal \((u\times v,\{3,4\},1,Q)\)-OOSPCs
- Grid-block difference families and related combinatorial structures
- Unified combinatorial constructions of optimal optical orthogonal codes
- Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
- Some series of optimal multilength OOCs of weight four
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Partial geometric difference families
- Existence of q-analogs of Steiner systems
- Bounds and constructions for \(\overline{3}\)-separable codes with length 3
- E-optimal 2ksaturated designs
- Cyclotomic constructions of external difference families and disjoint difference families
- Existence results for near resolvable designs
- scientific article; zbMATH DE number 1960890 (Why is no real title available?)
- Existence of (q, 7, 1) difference families with q a prime power
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- Forcing quasirandomness with triangles
- The existence of cyclic \(\mathrm{BIBD}(v,4,\lambda)\) -- a survey and new results
- scientific article; zbMATH DE number 2154971 (Why is no real title available?)
- Quasi-Random Set Systems
- Existence question for difference families and construction of some new families
- On the existence of simple BIBDs with number of elements a prime power
- Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs
- Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- Existence of simple BIBDs from a prime power difference family with minimum index
- Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
- External Difference Families from Finite Fields
- Difference families, difference matrices, and BIB-designs
- Quasi-random graphs
- \(V(m,t)\) and its variants
- Partitioned difference families and harmonious linear spaces
- Difference sets in pseudocyclic association schemes
- The preimage distributions of a class of zero-difference balanced functions and their partitioned difference families
- Constructions of balanced \((N, M, \{4, 5\}, 1; 2)\) multilength variable-weight optical orthogonal codes
- Graph decompositions in projective geometries
- Partitioned difference families and almost difference sets
- New results on optimal (v,4,2,1) optical orthogonal codes
- New optimal optical orthogonal codes by restrictions to subgroups
- Further results on optimal \((v,4,2,1)\)-OOCs
- Cyclic \((v;r,s;\lambda)\) difference families with two base blocks and \(v \leq 50\)
- Decomposing complete graphs into isomorphic complete multipartite graphs
- Tight Heffter arrays from finite fields
- Naimark-spatial families of equichordal tight fusion frames
- On disjoint \((v,k,k-1)\) difference families
- Fano kaleidoscopes and their generalizations
- On the ideal arithmetic autocorrelation of binary FCSR sequences
- The asymptotic existence of BIBDs having a nesting
- Banff designs: difference methods for coloring incidence graphs
This page was built for publication: Cyclotomy and difference families in elementary Abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2560249)