scientific article
From MaRDI portal
Publication:3996173
zbMath0691.05002MaRDI QIDQ3996173
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
binary Golay coderecursive constructionstournament designsdirect constructions using cyclic groups and finite fieldsWitt system
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)
Related Items (40)
\(Z\)-cyclic whist tournaments with a patterned starter initial round ⋮ Imbedding with a prime ⋮ Balanced Steiner triple systems ⋮ Equitable embeddings of Steiner triple systems ⋮ Intersection-sets in \(PG(n,2)\) ⋮ An infinite class of \(Z\)-cyclic whist tournaments on \(v\) players, \(v\equiv 1\pmod 4\) ⋮ Construction of referee squares ⋮ Asymptotic existence theorems for frames and group divisible designs ⋮ The 2‐intersection number of paths and bounded‐degree trees ⋮ More ZCPS-Wh\((v)\) and several new infinite classes of Z-cyclic whist tournaments ⋮ Classification of whist tournaments with up to 12 players ⋮ Unnamed Item ⋮ Regular LDPC codes from semipartial geometries ⋮ Decompositions of edge-colored complete graphs ⋮ Learning a hidden graph ⋮ QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY ⋮ New constructions for covering designs ⋮ A representation theorem and Z‐cyclic whist tournaments ⋮ A. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs” ⋮ Lower bounds for the transition complexity of NFAs ⋮ A construction of group divisible designs with block sizes 3 to 7 ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ Whist tournaments -- three person property ⋮ Steiner triple systems with near-rotational automorphisms ⋮ Cyclic Mendelsohn triple systems with a cyclic resolution or a cyclic almost resolution ⋮ On primitivity and reduction for flag-transitive symmetric designs ⋮ Unnamed Item ⋮ The size of minimum 3-trees: Cases 3 and 4 mod 6 ⋮ Reconstruction of hidden graphs and threshold group testing ⋮ A family of group divisible designs with arbitrary block sizes ⋮ A deterministic key predistribution method for wireless sensor networks based on hypercube multivariate scheme ⋮ Daisy structure in Desarguesian projective planes ⋮ Cyclically resolvable designs and triple whist tournaments ⋮ Z‐cyclic triplewhist tournaments when the number of players involves primes of the form 8u + 5 ⋮ On compressing complete designs ⋮ New constructions of quantum stabilizer codes based on difference sets ⋮ Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks ⋮ Construction of skolem sequences ⋮ Cyclic Whist tournaments ⋮ The Steiner tree polytope and related polyhedra
This page was built for publication:
