scientific article; zbMATH DE number 3103352
From MaRDI portal
zbMath0063.00542MaRDI QIDQ5842118
Publication date: 1942
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A new class of symmetric \((v,k,\lambda)\)-designs, Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial, On constructions and parameters of symmetric configurations \(v_k\), 2-walk-regular dihedrants from group-divisible designs, ON LINEARISED POLYNOMIALS, SIDON ARRAYS AND FAST CONSTRUCTION OF SIDON SETS, Online containers for hypergraphs, with applications to linear equations, On \((p^ a,p^ b,p^ a,p^{a-b})\)-relative difference sets, A multiplier theorem for projections of affine difference sets, A search for affine difference sets of even order, On automorphism groups of divisible designs: II: Group invariant generalized conference matrices, Gruppi affini d'incidenza, B_{h}[g MODULAR SETS FROM B_{h} MODULAR SETS], New constructions of group divisible designs, Disjoint sets of distinct sum sets, A generalization of group divisible t $t$‐designs, Partial geometric designs having circulant concurrence matrices, The apparent structure of dense Sidon sets, Families of twisted tensor product codes, Affine difference sets of even order, Generalized Sidon sets, Erdős and the integers, Unnamed Item, A new class of near-optimal partial Fourier codebooks from an almost difference set, Two applications of relative difference sets: difference triangles and negaperiodic autocorrelation functions, Difference bases in cyclic groups, Sets in \(\mathbb{Z}_n\) with distinct sums of pairs., On the balanced upper chromatic number of finite projective planes, Relative \((p^a, p^b, p^a, p^{a-b})\)-difference sets: A unified exponent bound and a local ring construction, On quasiregular collineation groups of projective planes, Some non-existence results on divisible difference sets, The Mann test for divisible difference sets, Upper bounds and constructions of complete asynchronous channel hopping systems, Some constructions of group divisible designs with Singer groups, Lower bounds on multiple difference sets, Explicit solutions to certain inf max problems from Turán power sum theory, Constructions of almost difference families, A Numerical Note on Upper Bounds for B2[g Sets], On symmetric intersecting families, Generic constructions for partitioned difference families with applications: a unified combinatorial approach, Asynchronous channel hopping systems from difference sets, Cyclic affine planes and Paley difference sets, ‐Relative Difference Sets and Their Representations, Hamiltonian property of the incidence graphs of quadrangles associated with symplectic forms on finite fields, On Costas sets and Costas clouds, On arcs sharing the maximum number of points with ovals in cyclic affine planes of odd order, Spreads, arcs, and multiple wavelength codes, Relative difference sets fixed by inversion and Cayley graphs, Packing designs with equal-sized holes, Cyclic relative difference sets with classical parameters, Some 20-regular CDP(5,1;20\(u\)) and their applications, Constructions of generalized Sidon sets., Relative difference sets and quasiregular collineation groups, Girth 5 graphs from relative difference sets, Sidon sets in \(\mathbb N^d\), Difference bases in dihedral groups, Generalized Bhaskar Rao designs with block size 3 over finite abelian groups, Elliptic semiplanes and regular graphs with girth 5, Composition theorems for difference families and regular planes, Maximal operators and decoupling for Λ(p) Cantor measures, On difference matrices and regular latin squares, Two results on maximum nonlinear functions, Self-dual configurations and regular graphs, A New Construction of Group Divisible Designs with Nonuniform Group Type, On the symmetry of Welch- and Golomb-constructed Costas arrays, Cyclic affine planes of even order, Improving bounds on the order of regular graphs of girth 5, New results on modular Golomb rulers, optical orthogonal codes and related structures, Harmonious order of graphs, A Sidon basis, Incidence graphs and subdesigns of semisymmetric designs, Partially user-irrepressible sequence sets and conflict-avoiding codes
