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
- 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
- Completely regular codes and completely transitive codes
- On perfect \(t\)-shift codes in abelian groups
- Cyclotomic schemes over finite rings
- Representations of finite association schemes
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- A new proof for the Erdős-Ko-Rado theorem for the alternating group
- The exact bound in the Erdős-Ko-Rado theorem
- The Erdős-Ko-Rado property for some 2-transitive groups
- Mac Williams identities and coordinate partitions
- A note on the existence of perfect constant weight codes
- t-designs in projective spaces
- The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\)
- Spreads in strongly regular graphs
- Alternating bilinear forms over GF(q)
- Association schemes and t-designs in regular semilattices
- Asymptotic analysis of the Krawtchouk polynomials by the WKB method
- On the clique number of a strongly regular graph
- New families of \(Q\)-polynomial association schemes
- Strengthened semidefinite programming bounds for codes
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
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)
