scientific article; zbMATH DE number 2232233
From MaRDI portal
Publication:5707657
Recommendations
Cited in
(only showing first 100 items - show all)- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- The subconstituent algebra of a Latin square
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- On Boolean functions with the sum of every two of them being bent
- Some results on skew Hadamard difference sets
- On tight projective designs
- On set systems with restricted intersections modulo p and p-ary t-designs
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- New examples of Euclidean tight 4-designs
- There are finitely many Q-polynomial association schemes with given first multiplicity at least three
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- Linear programming bounds for codes via a covering argument
- Lower bounds for projective designs, cubature formulas and related isometric embeddings
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- The mathematics of Donald Gordon Higman
- Bounds on subsets of coherent configurations
- Unitary designs and codes
- A survey on spherical designs and algebraic combinatorics on spheres
- Representations of finite association schemes
- Commutative association schemes
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs
- On a class of binary linear completely transitive codes with arbitrary covering radius
- Lower bounds for measurable chromatic numbers
- Generalized n-gons and Chebyshev polynomials
- Association algebras for finite projective planes
- On the rational spectra of graphs with Abelian Singer groups
- Association schemes of quadratic forms
- Harmonics on posets
- Algebraic decompositions of commutative association schemes
- On the nonbinary Johnson scheme
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Coding scheme for a wire-tap channel using regular codes
- Orthogonal polynomials - Constructive theory and applications
- On character sums and codes
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e 3 and q 3
- On orthogonal arrays of strength 3 and 5 achieving Rao's bound
- A family of nonbinary linear codes
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
- Balanced sets and Q-polynomial association schemes
- Some bounds for the distribution numbers of an association scheme
- Some distribution numbers of the hypercubic association scheme
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- t-designs in classical association schemes
- Association schemes and quadratic transformations for orthogonal polynomials
- An analogue of t-designs in the association schemes of alternating bilinear forms
- Symmetric designs as the solution of an extremal problem in combinatorial set theory
- Inequalities for quasisymmetric designs
- Geometric invariants for quasi-symmetric designs
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Characters of finite quasigroups. IV: Products and superschemes
- Duality in coherent configurations
- Tight 4 and 5-designs in projective spaces
- A characterization of the association schemes of bilinear forms
- A characterization of t-designs in terms of the inner distribution
- Feasibility conditions for non-symmetric 3-class association schemes
- Algebraic theory of block codes detecting independent errors
- Classification of graphs by regularity
- Ordered partitions and codes generated by circulant matrices
- Distances, graphs and designs
- Polar spaces, generalized hexagons and perfect codes
- Strongly regular graphs having strongly regular subconstituents
- Cube group invariant spherical harmonics and Krawtchouk polynomials
- The family of t-designs. Part I
- How many P-polynomial structures can an association scheme have?
- On the weight distribution of spherical t-designs
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Rational G-matrices with rational eigenvalues
- On the existence of certain distance-regular graphs
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
- Characterization of the odd graphs \(O_ k \)by parameters
- Tannaka-Krein duality for association schemes
- Galois correspondence between permutation groups and cellular rings (association schemes)
- Beyond the Erdős-Ko-Rado theorem
- The covering radius of spherical designs
- On pseudo-automorphisms and fusions of an association scheme
- Subschemes of some association schemes
- A spectral method for concordant polyhedral faces
- Local randomness in pseudorandom sequences
- The symbiotic relationship of combinatorics and matrix theory
- Symmetric divisible designs with \(k-\lambda{}_ 1=1\)
- On the maximum cardinality of binary constant weight codes with prescribed distance
- McFarland's conjecture on abelian difference sets with multiplier \(-1\)
- On the G-matrices with entries and eigenvalues in Q(i)
- On \(r\)-partition designs in Hamming spaces
- All \(s\)-sum sets of type 2 or 3 are triple-sum sets
- \(t\)-designs with general angle set
- On the cardinality of sets of sequences with given maximum correlation
- Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
- Two infinite classes of perfect codes in metrically regular graphs
- Nearly perfect codes in distance-regular graphs
- Association schemes and t-designs in regular semilattices
- Alternating bilinear forms over GF(q)
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- The triply shortened binary Hamming code is optimal
- Codes projectifs à deux poids, caps complets et ensembles de différences
- Spherical codes and designs
- Bilinear forms over a finite field, with applications to coding theory
- Weighted permutation problems and Laguerre polynomials
- Classification of a class of distance-regular graphs via completely regular codes
- Bose-Mesner algebras related to type II matrices and spin models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5707657)
