scientific article
From MaRDI portal
Publication:4074794
zbMath0314.94008MaRDI QIDQ4074794
Peter J. Cameron, J. H. van Lint
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of error-correcting codes and error-detecting codes (94B99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Graph theory (05Cxx) Designs and configurations (05Bxx)
Related Items (52)
On orthogonal arrays of strength 3 and 5 achieving Rao's bound ⋮ A remark on a theorem of P. de la Harpe and V. F. R. Jones ⋮ Cyclic projective planes and binary, extended cyclic self-dual codes ⋮ Über die Identität von MacWilliams für die Gewichtsfunktion von Codes ⋮ Reed-Muller codes, the fourth cohomology group of a finite group, and the \(\beta\)-invariant. ⋮ \(k\)-configurations ⋮ WOM-codes construits à partir des codes de Hamming ⋮ On almost nexus semi-symmetric designs ⋮ Graph-theoretic design and analysis of key predistribution schemes ⋮ Unnamed Item ⋮ Linear codes associated with geometric structures ⋮ Hyperplane partitions and difference systems of sets ⋮ Ramsey numbers based on \(C_ 5\)-decompositions ⋮ The application of invariant theory to the existence of quasi-symmetric designs ⋮ Geometric invariants for quasi-symmetric designs ⋮ Extending generalized quadrangles ⋮ On self-dual, doubly even codes of length 32 ⋮ Ovals in projective designs ⋮ 2-designs having an intersection number \(k-n\) ⋮ The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\) ⋮ Distance transitive digraphs ⋮ Remark on the generalized graph extension theorem ⋮ Strongly regular graphs having strongly regular subconstituents ⋮ Edge cosymmetric graphs ⋮ The family of t-designs. Part I ⋮ How many P-polynomial structures can an association scheme have? ⋮ Classical groups and metric association schemes ⋮ The extended Golay codes considered as ideals ⋮ On self-dual doubly-even extremal codes ⋮ Designs with no three mutually disjoint blocks ⋮ Equiarboreal graphs ⋮ Extremal geometric constants ⋮ Eigenvalue multiplicities of highly symmetric graphs ⋮ Strongly regular graphs and finite Ramsey theory ⋮ Mathematical recreations of Dénes König and his work on graph theory ⋮ On the parameters of codes for the Lee and modular distance ⋮ Paley and the Paley Graphs ⋮ Inequalities and bounds for quasi-symmetric 3-designs ⋮ On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length ⋮ Spazi geometrici e codici lineari associati ⋮ Spherical codes and designs ⋮ Condensed Ricci curvature of complete and strongly regular graphs ⋮ On a class of symmetric designs ⋮ Optimal designs for treatment comparisons represented by graphs ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs ⋮ Some geometric structures and bounds for Ramsey numbers ⋮ The uniqueness of the near hexagon on 729 points ⋮ Almost 2-homogeneous bipartite distance-regular graphs ⋮ Tactical decompositions of designs ⋮ Association schemes of quadratic forms ⋮ Invariant codes, difference schemes, and distributive quasigroups ⋮ A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
This page was built for publication:
