scientific article; zbMATH DE number 2232233
From MaRDI portal
Publication:5707657
zbMATH Open1075.05606MaRDI QIDQ5707657FDOQ5707657
Authors: Philippe Delsarte 
Publication date: 24 November 2005
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- Polar spaces, generalized hexagons and perfect codes
- A tribute to Dennis Stanton
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Complex spherical designs and codes
- A new upper bound on nonbinary block codes
- Weighted permutation problems and Laguerre polynomials
- Quadratic and symmetric bilinear forms over finite fields and their association schemes
- (𝑛+1,𝑚+1)-hypergeometric functions associated to character algebras
- Tight relative 2- and 4-designs on binary Hamming association schemes
- Harmonics on posets
- \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one
- Orthogonal polynomials - Constructive theory and applications
- Bounds for codes and designs in complex subspaces
- Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
- New non-existence proofs for ovoids of Hermitian polar spaces and hyperbolic quadrics
- A Higman inequality for regular near polygons
- Estimates of the distance distribution of codes and designs
- Spherical designs of harmonic index \(t\)
- A cross-intersection theorem for vector spaces based on semidefinite programming
- Spectral bounds for the independence ratio and the chromatic number of an operator
- On cliques in edge-regular graphs
- Generalizing Krawtchouk polynomials using Hadamard matrices
- A distribution invariant for association schemes and strongly regular graphs
- On structures of modular adjacency algebras of Johnson schemes
- On the existence of nested orthogonal arrays
- There are only finitely many distance-regular graphs of fixed valency greater than two
- Association schemes related to Delsarte-Goethals codes
- On the number of irreducible modular representations of a \(P\) and \(Q\) polynomial scheme
- Spectral bounds and distance-regularity
- Beyond the Erdős-Ko-Rado theorem
- An upper bound on the sum of squares of degrees in a hypergraph
- On the Delsarte-Goethals codes and their formal duals
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
- Characterizations of regularity for certain \(Q\)-polynomial association schemes
- On the optimum of Delsarte's linear program
- A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
- On \(r\)-partition designs in Hamming spaces
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Uniform eventown problems
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra
- Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs
- On symmetric association schemes and associated quotient-polynomial graphs
- Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph
- Imprimitive cometric association schemes: constructions and analysis
- Bounds on three- and higher-distance sets
- Tight relative 2-designs on two shells in Johnson association schemes
- Hypercontractivity of Spherical Averages in Hamming Space
- Association schemes related to Kasami codes and Kerdock sets
- On the equivalence between real mutually unbiased bases and a certain class of association schemes
- Invitation to intersection problems for finite sets
- On two-weight codes
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
- Strongly regular Cayley graphs over the group \({\mathbb Z}_{p^n}\oplus {\mathbb Z}_{p^n}\)
- A valency bound for distance-regular graphs
- Commutative association schemes
- Energy bounds for codes and designs in Hamming spaces
- On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii
- An Assmus-Mattson theorem for codes over commutative association schemes
- An analogue of t-designs in the association schemes of alternating bilinear forms
- t-designs in classical association schemes
- On designs in compact metric spaces and a universal bound on their size
- Distance-regular graphs without 4-claws
- Association schemes of small order
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- Universal lower bounds for potential energy of spherical codes
- \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
- On \(Q\)-polynomial regular near \(2d\)-gons
- Unitary designs and codes
- Ball packings with high chromatic numbers from strongly regular graphs
- Completely regular codes with different parameters giving the same distance-regular coset graphs
- On spherical designs of some harmonic indices
- One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes
- The homogeneous weight partition and its character-theoretic dual
- Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}
- Alphabet-almost-simple 2-neighbour-transitive codes
- On Rank and Kernel of ℤ4-Linear Codes
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Partitions of Frobenius rings induced by the homogeneous weight
- MacWilliams extension theorems and the local-global property for codes over Frobenius rings
- The subconstituent algebra of an association scheme. I
- Parameters of association schemes that are both P- and Q-polynomial
- Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\)
- Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\)
- Generalized Krawtchouk polynomials and the composition scheme
- A characterization of Delsarte's linear programming bound as a ratio bound
- Eigenvalue bounds for independent sets
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Entry-faithful 2-neighbour transitive codes
- Pairs of quadratic forms over finite fields
- A survey of partial difference sets
- Bilinear forms over a finite field, with applications to coding theory
- On Mitchell's embedding theorem for a quasi-schemoid
- Applications of coding theory to the construction of modular lattices
- On a conjecture of Brouwer involving the connectivity of strongly regular graphs
- Asymptotic Delsarte cliques in distance-regular graphs
- Some bounds for the number of blocks. III.
- Rank-metric codes and their duality theory
- A spectral equivalent condition of the \(P\)-polynomial property for association schemes
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)
