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)
- \(\mathbb{Z}_4\mathbb{Z}_4 [u]\)-additive cyclic and constacyclic codes
- Perfect codes in the discrete simplex
- McFarland's conjecture on abelian difference sets with multiplier \(-1\)
- The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
- On the regularity of perfect 2-colorings of the Johnson graph
- Association schemes on general measure spaces and zero-dimensional abelian groups
- Optimal measures for \(p\)-frame energies on spheres
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
- Completely regular designs of strength one
- On the high density behavior of Hamming codes with fixed minimum distance
- Designs on the web
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Feasibility conditions for non-symmetric 3-class association schemes
- Numerical invariants of strongly regular graphs
- Book review of: H.-H. Wu, Understanding numbers in elementary school mathematics
- Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes
- On splitting the Clebsch graph
- Class 3 association schemes whose symmetrizations have two classes
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- An effective algorithm for generation of factorial designs with generalized minimum aberration
- A new characterization of the dual polar graphs
- A Taxonomy of Perfect Domination
- A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs
- New and updated semidefinite programming bounds for subspace codes
- Modular adjacency algebras of dual polar schemes
- \(\mathbb Z_2\mathbb Z_4\)-additive formally self-dual codes
- Weighing matrices and spherical codes
- Quotient-polynomial graphs
- Double covers of symplectic dual polar graphs
- The Cameron-Liebler problem for sets
- Title not available (Why is that?)
- Semidefinite bounds for nonbinary codes based on quadruples
- Some bounds for the distribution numbers of an association scheme
- The mathematics of Donald Gordon Higman
- Subgroup perfect codes in Cayley sum graphs
- An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs
- How many P-polynomial structures can an association scheme have?
- A new approach for examining \(q\)-Steiner systems
- Characters of finite quasigroups. VI: Critical examples and doubletons
- Characters of finite quasigroups. IV: Products and superschemes
- A study of orthogonal arrays from the point of view of design theory
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
- On the uniqueness of the graphs G(n,k) of the Johnson schemes
- On Rosenbloom and Tsfasman's generalization of the Hamming space
- Linear programming bounds for codes via a covering argument
- Totient numbers of an arithmetic progression in a hypercube: The coprime case
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
- Upper bounds for \(s\)-distance sets and equiangular lines
- Canonical equation sets for classes of concordant polytopes
- Codes projectifs à deux poids, caps complets et ensembles de différences
- An extension of the Erdős-Ko-Rado theorem to uniform set partitions
- 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
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)
