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)
- Diameter bounds for geometric distance-regular graphs
- Kravchuk matrices and induced operators on Clifford algebras
- Totient-numbers of the rectangular association scheme
- On one-Lee weight and two-Lee weight \(\mathbb{Z}_2\mathbb{Z}_4[u]\) additive codes and their constructions
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Characterization of the odd graphs \(O_ k \)by parameters
- Bounds on sets with few distances
- Three characterizations of non-binary correlation-immune and resilient functions
- Optimal tristance anticodes in certain graphs
- On the integrability of strongly regular graphs
- Symmetric divisible designs with \(k-\lambda{}_ 1=1\)
- What is known about unit cubes
- The packing problem for projective geometries over GF(3) with dimension greater than five
- Schur rings and cyclic association schemes of class three
- Conway groupoids and completely transitive codes
- Association schemes and quadratic transformations for orthogonal polynomials
- On Bonisoli's theorem and the block codes of Steiner triple systems
- Zeros of generalized Krawtchouk polynomials
- Smith normal forms of incidence matrices
- Proper partial geometries with Singer groups and pseudogeometric partial difference sets
- Title not available (Why is that?)
- Coherent algebras and the graph isomorphism problem
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Homogeneity of a distance-regular graph which supports a spin model
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Weakly Hadamard diagonalizable graphs
- The symbiotic relationship of combinatorics and matrix theory
- Spin models and strongly hyper-self-dual Bose-Mesner algebras
- The family of t-designs. Part I
- Orthogonal partitions in designed experiments
- On the existence of certain distance-regular graphs
- Pairs of codes with prescribed Hamming distances and coincidences
- Tight 4 and 5-designs in projective spaces
- Root systems and the Johnson and Hamming graphs
- Non-existence and construction of pre-difference sets, and equi-distributed subsets in association schemes
- The subconstituent algebra of a Latin square
- Amorphic association schemes with negative Latin square-type graphs
- A Lloyd theorem in weakly metric association schemes
- Duality in coherent configurations
- Distances, graphs and designs
- Characters of finite quasigroups
- On spin models, modular invariance, and duality
- A characterization of the association schemes of bilinear forms
- Some remarks on Euclidean tight designs
- A direct approach to linear programming bounds for codes and tms-nets
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Parameters of t-designs in \({\mathbb{F}}P^{d-1}\)
- The family of t-designs. II
- On the automorphism groups of the \(\mathbb Z_2\mathbb Z_4\)-linear Hadamard codes and their classification
- A semidefinite programming approach to a cross-intersection problem with measures
- On spin models, triply regular association schemes, and duality
- Pseudocyclic 3-class association schemes on 28 points
- Algebraic decompositions of commutative association schemes
- Multicast key distribution schemes based on Stinson-Van Trung designs
- Quotients of association schemes
- Geometric invariants for quasi-symmetric designs
- Rank-metric codes and their applications
- The triple distribution of codes and ordered codes
- New parameters of subsets in polynomial association schemes
- Two infinite classes of perfect codes in metrically regular graphs
- Title not available (Why is that?)
- On perfect binary codes
- On subsets of partial difference sets
- 3-setwise intersecting families of the symmetric group
- Balanced sets and Q-polynomial association schemes
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- A new strongly regular graph
- On character sums and codes
- Geometric representations of \(\text{GL}(n,R)\), cellular Hecke algebras and the embedding problem.
- Beyond the orthogonal array concept.
- Title not available (Why is that?)
- 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
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)
