scientific article
From MaRDI portal
Publication:4040243
zbMath0643.05002MaRDI QIDQ4040243
Publication date: 5 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Majority codes (94B30) Designs and configurations (05Bxx)
Related Items (74)
On the binary codes of length 552 which admit the simple group Co3 as a transitive permutation group ⋮ Designs with the symmetric difference property on 64 points and their groups ⋮ Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ Some new results on Hadamard modulo prime matrices ⋮ On resolvable Steiner 2-designs and maximal arcs in projective planes ⋮ The existence of extremal self-dual [50,25,10 codes and quasi-symmetric 2-(49,9,6) designs] ⋮ On Quasi-symmetric 2-(64, 24, 46) Designs Derived from Codes ⋮ Linear codes and doubly transitive symmetric designs ⋮ The weight distribution of the self-dual \([128,64\) polarity design code] ⋮ On near-MDS codes ⋮ Divisible Design Digraphs ⋮ Steiner triple systems of order 15 and their codes ⋮ Classification of affine resolvable \(2\)-\((27,9,4)\) designs ⋮ On the equivalence of certain constant weight codes and combinatorial designs ⋮ The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes] ⋮ New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\) ⋮ Linear codes and the existence of a reversible Hadamard difference set in \(\mathbb{Z}_ 2\times \mathbb{Z}_ 2\times \mathbb{Z}_ 5^ 4\) ⋮ Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$ ⋮ Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes ⋮ New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28 ⋮ Codes from lattice and related graphs, and permutation decoding ⋮ Linearly embeddable designs ⋮ On symmetric transversal designs STD\(_8[24; 3\)'s] ⋮ Extension sets, affine designs, and Hamada's conjecture ⋮ Unnamed Item ⋮ On some distance-regular graphs with many vertices ⋮ Extremal ternary self-dual codes of length 36 and symmetric 2-(36, 15, 6) designs with an automorphism of order 2 ⋮ Special \textit{LCD} codes from products of graphs ⋮ Distance-regular graphs and new block designs obtained from the Mathieu groups ⋮ On symmetric \(2\)-\((70,24,8)\) designs with an automorphism of order \(6\) ⋮ Construction of transitive \(q\)-analogs of designs ⋮ Some sequences of optimal constant weight codes ⋮ Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31 ⋮ Automorphism groups of a symmetric transversal design \(\text{STD}_2[12; 6\)] ⋮ Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs ⋮ Extremal doubly-even codes of length 64 derived from symmetric designs ⋮ Permutation decoding for the binary codes from triangular graphs. ⋮ Codes and designs from triangular graphs and their line graphs ⋮ On affine designs and Hadamard designs with line spreads ⋮ Permutation decoding for binary codes from lattice graphs ⋮ Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs ⋮ Self-dual codes and Hadamard matrices ⋮ On symmetric nets and generalized Hadamard matrices from affine designs ⋮ Good equidistant codes constructed from certain combinatorial designs ⋮ On symmetric and quasi-symmetric designs with the symmetric difference property and their codes ⋮ Symmetric and resolvable \(\lambda \)-configurations constructed from block designs ⋮ On the binary codes of Steiner triple systems ⋮ Some small non-embeddable designs ⋮ On Kirkman triple systems of order 33 ⋮ Unnamed Item ⋮ On the support designs of extremal binary doubly even self-dual codes ⋮ Optimal binary constant weight codes and affine linear groups over finite fields ⋮ Cyclotomic trace codes ⋮ Symmetric 2-(69, 17, 4) designs with automorphisms of order 13 ⋮ Quasi-symmetric \(2\)-\((64, 24, 46)\) designs derived from \(\mathrm{AG}(3, 4)\) ⋮ New 3-designs and 2-designs having \(U(3, 3)\) as an automorphism group ⋮ Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$, $q leq 23$ ⋮ Enumeration of the doubles of the projective plane of order 4 ⋮ A useful tool for constructing linear codes ⋮ A class of non-embeddable designs ⋮ Unnamed Item ⋮ Hadamard 2-(63,31,15) designs invariant under the dihedral group of order 10 ⋮ Automorphisms of 2-(22,8,4) designs ⋮ Optimal antiblocking systems of information sets for the binary codes related to triangular graphs ⋮ Binary codes from graphs on triples ⋮ Two classes of \(q\)-ary codes based on group divisible association schemes ⋮ A new upper bound for binary codes with minimum distance four ⋮ Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group ⋮ Note on a characterization of projective planes ⋮ Quasi-symmetric 2-(41, 9, 9) designs and doubly even self-dual codes of length 40 ⋮ Quasi-symmetric designs, codes, quadrics, and hyperplane sections ⋮ Quadratic residue codes, rank three groups and PBIBDs ⋮ On partial geometries arising from maximal arcs ⋮ Perfect codes and balanced generalized weighing matrices. II
This page was built for publication:
