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)
- 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
- Linear programming bounds for regular graphs
- Bounds for regular induced subgraphs of strongly regular graphs
- On cryptographic propagation criteria for Boolean functions
- A survey on spherical designs and algebraic combinatorics on spheres
- The subconstituent algebra of a strongly regular graph
- Total perfect codes in Cayley graphs
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
- Association schemes arising from bent functions
- Spherical codes and designs
- \(Z_2Z_4\)-linear codes: rank and kernel
- Fourier-reflexive partitions and MacWilliams identities for additive codes
- Perfect state transfer on distance-regular graphs and association schemes
- The density of sets avoiding distance 1 in Euclidean space
- Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs
- Width and dual width of subsets in polynomial association schemes
- Symmetric bilinear forms over finite fields of even characteristic
- Erdös–Ko–Rado Theorem—22 Years Later
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Tight 2-designs and perfect 1-codes in Doob graphs
- Application of cover-free codes and combinatorial designs to two-stage testing.
- Landscapes and their correlation functions
- On the theta number of powers of cycle graphs
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Minimal binary 2-neighbour-transitive codes
- Anticodes for the Grassmann and bilinear forms graphs
- Finite rings with applications.
- New families of completely regular codes and their corresponding distance regular coset graphs
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- Discrete Serrin's problem
- Neighbour-transitive codes in Johnson graphs
- Neighbour-transitive codes and partial spreads in generalised quadrangles
- Association schemoids and their categories
- Perfect codes in the graphs \(O_k\)
- Codes and anticodes in the Grassman graph
- Cyclotomic graphs and perfect codes
- Some Erdös–Ko–Rado Theorems for Chevalley Groups
- Preface
- Perfect codes in Cayley sum graphs
- On subgroup perfect codes in Cayley graphs
- Invariant Semidefinite Programs
- Perfect 2-colorings of the Grassmann graph of planes
- Optimal line packings from nonabelian groups
- Uniqueness of codes using semidefinite programming
- \(\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
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)
