scientific article

zbMath1101.05001MaRDI QIDQ3411976

No author found.

Publication date: 1 December 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Collections of articles of miscellaneous specific interest (00B15) Designs and configurations (05Bxx)

Related Items (only showing first 100 items - show all)

Self-dual codes from extended orbit matrices of symmetric designs ⋮ Further results on mutually nearly orthogonal Latin squares ⋮ A generalization of Hadamard matrices ⋮ Uniformly resolvable decompositions of \(K_v\) into \(K_2\) and \(K_{1, 3}\) graphs ⋮ Two-weight codes, graphs and orthogonal arrays ⋮ On automorphism groups of divisible designs acting regularly on the set of point classes ⋮ Orthogonal trades and the intersection problem for orthogonal arrays ⋮ Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges ⋮ Decompositions of complete graphs into circulants ⋮ Optimal two-level designs for partial profile choice experiments ⋮ Graph-theoretic design and analysis of key predistribution schemes ⋮ On generalized Howell designs with block size three ⋮ Resolvable generalized difference matrices: existence and applications ⋮ On the \(\mathrm{GF}(p)\) linear complexity of Hall's sextic sequences and some cyclotomic-set-based sequences ⋮ A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime ⋮ Silver block intersection graphs of Steiner 2-designs ⋮ An approach of constructing mixed-level orthogonal arrays of strength \(\geqslant 3\) ⋮ Super-simple resolvable balanced incomplete block designs with block size 4 and index 4 ⋮ The existence of \((K_2\times K_6)\)-designs ⋮ Improved bounds for separating hash families ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Exotic complex Hadamard matrices and their equivalence ⋮ Mutually orthogonal Latin squares and mutually unbiased bases in dimensions of odd prime power MOLS and mubs in odd prime power dimensions ⋮ New tools for the construction of directed strongly regular graphs: difference digraphs and partial sum families ⋮ On parity vectors of Latin squares ⋮ 2-spreads and transitive and orthogonal 2-parallelisms of \(PG(5, 2)\) ⋮ Efficient two-stage group testing algorithms for genetic screening ⋮ Gregarious GDDs with two associate classes ⋮ On the existence of resolvable \((K_{3} + e)\)-group divisible designs ⋮ An enumeration of equilateral triangle dissections ⋮ Triple metamorphosis of twofold triple systems ⋮ Cubic factorizations ⋮ Generalized packing designs ⋮ Tree-designs with balanced-type conditions ⋮ Multimagic rectangles based on large sets of orthogonal arrays ⋮ On the existence of three dimensional room frames and Howell cubes ⋮ On large sets of projective planes of orders 3 and 4 ⋮ Minimum embedding of STSs into \((K_3+e)\)-systems ⋮ On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites ⋮ \(f\)-vectors of pure complexes and pure multicomplexes of rank three ⋮ Strongly regular graphs with non-trivial automorphisms ⋮ A new upper bound on the parameters of quasi-symmetric designs ⋮ Generalized balanced tournament designs with block size four ⋮ Optical grooming with grooming ratio nine ⋮ On the codegree density of complete 3-graphs and related problems ⋮ On the existence of orthogonal arrays OA\((3,5,4n+2)\) ⋮ Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Characterizing geometric designs. II. ⋮ Classification of difference matrices over cyclic groups ⋮ A construction for \(t\)-fold perfect authentication codes with arbitration ⋮ On the directed Oberwolfach problem with equal cycle lengths ⋮ Non-existence of point-transitive \(2\)-\((106, 6, 1)\) designs ⋮ Switching in one-factorisations of complete graphs ⋮ On the inclusion matrix \(W_{23}(v)\) ⋮ Additional constructions to solve the generalized Russian cards problem using combinatorial designs ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ A tabu search algorithm for the covering design problem ⋮ Optimal locating arrays for at most two faults ⋮ Friendship 3-hypergraphs ⋮ Group divisible designs with two associate classes and \(\lambda_{2}=1\) ⋮ On triple systems and strongly regular graphs ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ A large order asymptotic existence theorem for group divisible 3-designs with index one ⋮ Strongly regular graphs constructed from \(p\)-ary bent functions ⋮ Some comments on Latin squares and on Graeco-Latin squares, illustrated with postage stamps and old playing cards ⋮ Optimization for simulation: LAD accelerator ⋮ Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ Optimum mixed level detecting arrays ⋮ Sets of orthogonal hypercubes of class \(r\) ⋮ Note on the tight relative 2-designs on \(H(n,2)\) ⋮ On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph ⋮ Round-robin tournaments with homogeneous rounds ⋮ Incomplete group divisible designs with block size four and general index ⋮ Weight distribution of preparata codes over \(Z_4\) and the construction of 3-designs ⋮ The spectrum for overlarge sets of hybrid triple systems ⋮ Two series of equitable symbol weight codes meeting the Plotkin bound ⋮ Some constructions for \(t\) pairwise orthogonal diagonal Latin squares based on difference matrices ⋮ Resolvable 3-star designs ⋮ On the existence of holey 4-cycle frames ⋮ Orbit-disjoint regular \((n, 3, 1)\)-CDPs and their applications to multilength OOCs ⋮ Completely reducible super-simple designs with block size five and index two ⋮ Existence of Yang Hui type magic squares ⋮ Asymptotic existence of frame-GBTDs ⋮ Families of optimal packings in real and complex Grassmannian spaces ⋮ Generic constructions for partitioned difference families with applications: a unified combinatorial approach ⋮ A subspace covering problem in the \(n\)-cube ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ Simple \(t\)-designs: a recursive construction for arbitrary \(t\) ⋮ Extending permutation arrays: improving MOLS bounds ⋮ Iterated local search with Trellis-neighborhood for the partial Latin square extension problem ⋮ Archimedean graph designs. II. ⋮ Mutually orthogonal equitable Latin rectangles ⋮ A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6 ⋮ Designs having the parameters of projective and affine spaces ⋮ Some 20-regular CDP(5,1;20\(u\)) and their applications ⋮ Two spectral characterizations of regular, bipartite graphs with five eigenvalues ⋮ Mutually orthogonal rectangular gerechte designs ⋮ Optimum detecting arrays for independent interaction faults

This page was built for publication: