scientific article
From MaRDI portal
Publication:3686719
zbMath0569.05002MaRDI QIDQ3686719
Hanfried Lenz, Dieter Jungnickel, Thomas Beth
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
existenceconstructionspairwise balanced designsorthogonal arraysBIBDbalanced incomplete block designst-designsorthogonal latin squares
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Statistical block designs (62K10) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (only showing first 100 items - show all)
On an infinite class of Steiner systems with \(t=3\) and \(k=6\) ⋮ On Wilbrink's theorem ⋮ On generalized quasi-residual designs ⋮ Simple quasidoubles of projective planes ⋮ An elementary proof of Wilbrink's theorem ⋮ The strong chromatic number of partial triple systems ⋮ Projective extensions of Kirkman systems as substructures of projective planes ⋮ On resolvable designs \(S_ 3(3;4,v)\) ⋮ A characterization of designs related to dodecads in the Witt system S(5,8,24) ⋮ New results for quasi-symmetric designs\(-\) an application of MACSYMA ⋮ (81,16,3) Abelian difference sets do not exist ⋮ On existence and number of orthogonal arrays ⋮ Factorizations of symmetric designs ⋮ Edge-coloured designs with block size four ⋮ Mininal linear spaces ⋮ Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)] ⋮ On difference matrices, transversal designs, resolvable transversal designs and large sets of mutually orthogonal F-squares ⋮ Orthogonal arrays obtained by repeating-column difference matrices ⋮ Key storage in secure networks ⋮ Partial spreads over \({\mathbb{Z}}_ q\) ⋮ Abelian projective planes of square order ⋮ Quasi-symmetric \(\{\) \(\delta\) ,\(\mu\) \(\}\)-biplanes ⋮ Petersen graph decompositions of complete multipartite graphs ⋮ Existence of three HMOLS of types \(h^ n\) and \(2^ n3^ 1\) ⋮ Some new partially symmetric designs and their resolution ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ The existence of strong complete mappings of finite groups: a survey ⋮ Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\) ⋮ Rectangular groupoids and related structures ⋮ Normally regular digraphs ⋮ Some new results on mutually orthogonal frequency squares ⋮ Non-existence of point-transitive \(2\)-\((106, 6, 1)\) designs ⋮ Tight relative 2-designs on two shells in Johnson association schemes ⋮ On combinatorial designs with subdesigns ⋮ A construction for authentication/secrecy codes from 3-homogeneous permutation groups ⋮ Some self-blocking block designs ⋮ Affine difference sets of even order ⋮ A new family of relative difference sets ⋮ On packing designs with block size 5 and index 4 ⋮ On Alspach's conjecture ⋮ The Steiner systems S(2,4,25) with nontrivial automorphism group ⋮ The combinatorics of authentication and secrecy codes ⋮ A Cartesian product construction for unconditionally secure authentication codes that permit arbitration ⋮ On splitting sets in block designs and finding roots of polynomials ⋮ Extremal doubly-even codes of length 64 derived from symmetric designs ⋮ A family of relative difference sets associated with Hjelmslev structures over finite projective spaces ⋮ Further results on incomplete (3,2,1)-conjugate orthogonal idempotent Latin squares ⋮ On grid intersection graphs ⋮ Cores of geometric graphs ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions ⋮ Über die Schnittzahlen mehrfach balancierter Blockpläne. (On intersection numbers of \(t\)-fold balanced block designs) ⋮ Supersolvable and modularly complemented matroid extensions ⋮ Some non-existence results on divisible difference sets ⋮ The existence of non-trivial hyperfactorizations of \(K_{2n}\) ⋮ Group divisible designs with block size four and group type \(g^um^1\) ⋮ Improvement of Bruck's completion theorem ⋮ The classification of doubly transitive affine designs ⋮ Some non-isomorphic \((4t+4,8t+6,4t+3,2t+2,2t+1)\)-BIBD's ⋮ A survey of Kirkman triple systems and related designs ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ A brief review on Egmont Köhler's mathematical work ⋮ The 2-rotational Steiner triple systems of order 25 ⋮ Some naive constructions of \(S(2,3,\nu{})\) and \(S(2,4,\nu{})\) ⋮ On infinite Steiner systems ⋮ Cyclic 2-(91,6,1) designs with multiplier automorphisms ⋮ The spectrum of \(\alpha\)-resolvable block designs with block size 3 ⋮ On the simplicity of \(\cdot 2\) and \(\cdot 3\) ⋮ About special classes of Steiner systems \(S(2,4,\nu{})\) ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ On symmetric and quasi-symmetric designs with the symmetric difference property and their codes ⋮ Symmetric and resolvable \(\lambda \)-configurations constructed from block designs ⋮ Quasi-symmetric designs and biplanes of characteristic three ⋮ Nesting directed cycle systems of even length ⋮ Packing designs with block size 6 and index 5 ⋮ Existence of perfect Mendelsohn designs with \(k=5\) and \(\lambda{}>1\) ⋮ Constructions of perfect Mendelsohn designs ⋮ The covering radius of Hadamard codes in odd graphs ⋮ Some 2-ranks ⋮ On block designs with repeated blocks ⋮ A recursive method for construction of designs ⋮ Maximal sets of mutually orthogonal Latin squares. II ⋮ \(t\)-divisible designs from imprimitive permutation groups ⋮ Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution ⋮ Holey Steiner pentagon systems and related designs ⋮ Packing of \(K_{v}\) with certain graphs of five vertices ⋮ The spectrum of optimal strong partially balanced designs with block size five ⋮ The elementary Abelian Steiner systems S(2,4,49) ⋮ Some more 5-GDDs, 4-frames and 4-RGDDs ⋮ Nesting of cycle systems of odd length ⋮ Several 2-(46,6,3) designs ⋮ Existence of \(r\)-fold perfect \((v,K,1)\)-Mendelsohn designs with \(K\subseteq \{4,5,6,7\}\) ⋮ Variations on seven points: An introduction to the scope and methods of coding theory and finite geometries ⋮ Two remarks on affine designs with classical parameters ⋮ On the existence of small quasimultiples of affine and projective planes of arbitrary order ⋮ Extremal problems whose solutions are the blowups of the small Witt- designs ⋮ Maximal difference matrices of order \(\leq 10\) ⋮ Quasimultiples of projective and affine planes ⋮ Scheduling CCRR tournaments ⋮ Resolvable group divisible designs with block size four and index three
This page was built for publication:
