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
- Linear codes on posets with extension property
- A Cheeger inequality of a distance regular graph using Green's function
- On a family of binary completely transitive codes with growing covering radius
- On relative \(t\)-designs in polynomial association schemes
- New examples of Euclidean tight 4-designs
- The Maximum k-Colorable Subgraph Problem and Related Problems
- New inequalities for \(q\)-ary constant-weight codes
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
- On non-antipodal binary completely regular codes
- Some implications on amorphic association schemes
- Intriguing sets of vertices of regular graphs
- Pseudocyclic association schemes and strongly regular graphs
- On a class of binary linear completely transitive codes with arbitrary covering radius
- Geometric aspects of 2-walk-regular graphs
- Subschemes of some association schemes
- A simple proof of the Delsarte inequalities
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Three-class association schemes
- Spectral approach to linear programming bounds on codes
- Synchronising primitive groups of diagonal type exist
- Improved Delsarte bounds for spherical codes in small dimensions
- Some results on skew Hadamard difference sets
- Bounds on permutation codes of distance four
- A universal bound for a covering in regular posets and its application to pool testing
- Some colouring problems for Paley graphs
- Inequalities for quasisymmetric designs
- Rational G-matrices with rational eigenvalues
- Difference set constructions of DRADs and association schemes
- Association schemes of quadratic forms
- On the Delsarte inequalities
- Research problems from the 18th British Combinatorial Conference
- A new proof of several inequalities on codes and sets
- On new completely regular \(q\)-ary codes
- Codes from adjacency matrices of uniform subset graphs
- The Erdős-Ko-Rado theorem for twisted Grassmann graphs
- On the existence of saturated and nearly saturated asymmetrical orthogonal arrays
- Intersection matrices revisited
- New upper bounds for kissing numbers from semidefinite programming
- Permutation codes
- Remarks on the concepts of \(t\)-designs
- Semidefinite programming in combinatorial optimization
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs
- On perfect and Reed-Muller codes over finite fields
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Galois correspondence between permutation groups and cellular rings (association schemes)
- Lifting constructions of strongly regular Cayley graphs
- Dual distances of completely regular codes
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)
