Publication:5707657
From MaRDI portal
zbMath1075.05606MaRDI QIDQ5707657
Publication date: 24 November 2005
Related Items
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields, Characterization of the odd graphs \(O_ k \)by parameters, Tannaka-Krein duality for association schemes, Galois correspondence between permutation groups and cellular rings (association schemes), Beyond the Erdős-Ko-Rado theorem, The covering radius of spherical designs, On pseudo-automorphisms and fusions of an association scheme, Subschemes of some association schemes, A spectral method for concordant polyhedral faces, Local randomness in pseudorandom sequences, The symbiotic relationship of combinatorics and matrix theory, Symmetric divisible designs with \(k-\lambda{}_ 1=1\), On the maximum cardinality of binary constant weight codes with prescribed distance, McFarland's conjecture on abelian difference sets with multiplier \(-1\), On the \(G\)-matrices with entries and eigenvalues in \(Q(i)\), On \(r\)-partition designs in Hamming spaces, All \(s\)-sum sets of type 2 or 3 are triple-sum sets, \(t\)-designs with general angle set, On the cardinality of sets of sequences with given maximum correlation, Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\), Two infinite classes of perfect codes in metrically regular graphs, Nearly perfect codes in distance-regular graphs, Association schemes and t-designs in regular semilattices, Alternating bilinear forms over GF(q), On perfect codes in the Hamming schemes H(n,q) with q arbitrary, The triply shortened binary Hamming code is optimal, Codes projectifs à deux poids, caps complets et ensembles de différences, Spherical codes and designs, Bilinear forms over a finite field, with applications to coding theory, Weighted permutation problems and Laguerre polynomials, Classification of a class of distance-regular graphs via completely regular codes, Bose-Mesner algebras related to type II matrices and spin models, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications, Modular invariance property of association schemes, type II codes over finite rings and finite abelian groups and reminiscences of François Jaeger (a survey), Metric coset schemes revisited, Three-class association schemes, Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs, On balanced orthogonal multi-arrays: Existence, construction and application to design of experiments, Association schemes of small order, Cyclotomic schemes over finite, commutative, admissible rings, Cyclotomic schemes over finite rings, Association schemes and fusion algebras. (An introduction), \((2s-1)\)-designs with \(s\) intersection numbers, Weight distribution and dual distance, Completely regular designs of strength one, On subsets of partial difference sets, On existence of two symbol complete orthogonal arrays, A survey of partial difference sets, On splitting the Clebsch graph, 5-designs with three intersection numbers, Quotients of association schemes, Class 3 association schemes whose symmetrizations have two classes, Applications of coding theory to the construction of modular lattices, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, On spin models, modular invariance, and duality, A linear programming bound for orthogonal arrays with mixed levels, Semidefinite programming in combinatorial optimization, On the Delsarte inequalities, Landscapes and their correlation functions, On the covering radius of an unrestricted code as a function of the rate and dual distance, On Jackson's theorem in the space \(\ell_2(\mathbb{Z}_2^n)\), Width and dual width of subsets in polynomial association schemes, An upper bound on the sum of squares of degrees in a hypergraph, 1-homogeneous graphs with cocktail party \({\mu}\)-graphs, Beyond the orthogonal array concept., Designs in a coset geometry: Delsarte theory revisited., Tight 2-designs and perfect 1-codes in Doob graphs, Problems on discrete metric spaces, On designs in compact metric spaces and a universal bound on their size, A family of partial difference sets with Denniston parameters in nonelementary abelian 2-groups, Codes and anticodes in the Grassman graph, On the variance of average distance of subsets in the Hamming space, Spectral bounds and distance-regularity, On spin models, triply regular association schemes, and duality, Three characterizations of non-binary correlation-immune and resilient functions, On perfect \(t\)-shift codes in abelian groups, Mac Williams identities and coordinate partitions, A Cauchy-Khinchin matrix inequality, A universal bound for a covering in regular posets and its application to pool testing, Research problems from the 18th British Combinatorial Conference, Application of cover-free codes and combinatorial designs to two-stage testing., On \((v,k,\lambda{})\) graphs and designs with trivial automorphism group, Root systems and the Johnson and Hamming graphs, On schematic orthogonal arrays \(OA(q^ t,k,q,t)\), Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs), 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, Inequalities for t designs, An association scheme for the 1-factors of the complete graph, The family of t-designs. II, The packing problem for projective geometries over GF(3) with dimension greater than five, Perfect codes in the graphs \(O_k\), On cryptographic propagation criteria for Boolean functions, On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances, A new proof of several inequalities on codes and sets, Anticodes for the Grassmann and bilinear forms graphs, An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions, Special sets of lines in PG(3,2), On product of association schemes and Shannon capacity, On the existence of saturated and nearly saturated asymmetrical orthogonal arrays, Zeros of generalized Krawtchouk polynomials, t-designs in projective spaces, A note on the existence of perfect constant weight codes, 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, Orthogonal partitions in designed experiments, Spreads in strongly regular graphs, The subconstituent algebra of an association scheme. I, The exact bound in the Erdős-Ko-Rado theorem, The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), A distribution invariant for association schemes and strongly regular graphs, Parameters of association schemes that are both P- and Q-polynomial, A study of orthogonal arrays from the point of view of design theory, Characters of finite quasigroups, Parameters of t-designs in \({\mathbb{F}}P^{d-1}\), A new strongly regular graph, Pseudocyclic 3-class association schemes on 28 points, Totient numbers of an arithmetic progression in a hypercube: The coprime case, Canonical equation sets for classes of concordant polytopes, A simple proof of the Delsarte inequalities, Optimal tristance anticodes in certain graphs, Some colouring problems for Paley graphs, Trees, wreath products and finite Gelfand pairs, Pairs of codes with prescribed Hamming distances and coincidences, On the high density behavior of Hamming codes with fixed minimum distance, On the number of irreducible modular representations of a \(P\) and \(Q\) polynomial scheme, New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming, Designs on the web, Geometric representations of \(\text{GL}(n,R)\), cellular Hecke algebras and the embedding problem., Strengthened semidefinite programming bounds for codes, A characterization of Delsarte's linear programming bound as a ratio bound, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, Imprimitive cometric association schemes: constructions and analysis, Totient-numbers of the rectangular association scheme, Completely regular codes and completely transitive codes, Schur rings and cyclic association schemes of class three, An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs, Coherent algebras and the graph isomorphism problem, Characters of finite quasigroups. VI: Critical examples and doubletons, A new upper bound on nonbinary block codes, On the Delsarte-Goethals codes and their formal duals, Inheritance of hyper-duality in imprimitive Bose-Mesner algebras, On diameter perfect constant-weight ternary codes, On new completely regular \(q\)-ary codes, On the minimum average distance of binary constant weight codes, On non-antipodal binary completely regular codes, Eigenvalue bounds for independent sets, On the regularity of perfect 2-colorings of the Johnson graph, On the existence of nested orthogonal arrays, Asymptotic analysis of the Krawtchouk polynomials by the WKB method, Lower bounds on the minimum average distance of binary codes, Amorphic association schemes with negative Latin square-type graphs, A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations, The subconstituent algebra of a Latin square, Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets, Generalized n-gons and Chebyshev polynomials, Association algebras for finite projective planes, On the rational spectra of graphs with Abelian Singer groups, Association schemes of quadratic forms, Harmonics on posets, Algebraic decompositions of commutative association schemes, On the nonbinary Johnson scheme, On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\), Coding scheme for a wire-tap channel using regular codes, Orthogonal polynomials - Constructive theory and applications, On character sums and codes, On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\), On orthogonal arrays of strength 3 and 5 achieving Rao's bound, A family of nonbinary linear codes, Upper bounds for constant weight and Lee codes slightly outside the Plotkin range, Balanced sets and Q-polynomial association schemes, Some bounds for the distribution numbers of an association scheme, Some distribution numbers of the hypercubic association scheme, An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms, t-designs in classical association schemes, Association schemes and quadratic transformations for orthogonal polynomials, An analogue of t-designs in the association schemes of alternating bilinear forms, Symmetric designs as the solution of an extremal problem in combinatorial set theory, Inequalities for quasisymmetric designs, Geometric invariants for quasi-symmetric designs, A characterization of \(P\)- and \(Q\)-polynomial association schemes, Characters of finite quasigroups. IV: Products and superschemes, Duality in coherent configurations, Tight 4 and 5-designs in projective spaces, A characterization of the association schemes of bilinear forms, A characterization of t-designs in terms of the inner distribution, Feasibility conditions for non-symmetric 3-class association schemes, Algebraic theory of block codes detecting independent errors, Classification of graphs by regularity, Ordered partitions and codes generated by circulant matrices, Distances, graphs and designs, Polar spaces, generalized hexagons and perfect codes, Strongly regular graphs having strongly regular subconstituents, Cube group invariant spherical harmonics and Krawtchouk polynomials, The family of t-designs. Part I, How many P-polynomial structures can an association scheme have?, On the weight distribution of spherical t-designs, An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q), Rational G-matrices with rational eigenvalues, On the existence of certain distance-regular graphs, Estimates of the distance distribution of codes and designs, What is known about unit cubes, (𝑛+1,𝑚+1)-hypergeometric functions associated to character algebras, Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes, Unnamed Item, On perfect binary codes, The covering radius of doubled 2-designs in \(2O_ k\), An application of information theory and error-correcting codes to fractional factorial experiments, On tight spherical designs, Spin models and strongly hyper-self-dual Bose-Mesner algebras, On the optimum of Delsarte's linear program, Strengthening the Gilbert-Varshamov bound, On covering radii and coset weight distributions of extremal binary self-dual codes of length 40, Dual distances of completely regular codes, More zeros of Krawtchouk polynomials, A direct approach to linear programming bounds for codes and tms-nets, The characterization of binary constant weight codes meeting the bound of Fu and Shen, The subconstituent algebra of a strongly regular graph, \(t\)-resilient functions and the partial exposure problem, Linear programming bounds for balanced arrays, On Rosenbloom and Tsfasman's generalization of the Hamming space, An effective algorithm for generation of factorial designs with generalized minimum aberration, Multicast key distribution schemes based on Stinson-Van Trung designs, Proper partial geometries with Singer groups and pseudogeometric partial difference sets, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Determination of weight enumerators of binary extremal self-dual \([42,21,8\) codes], Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, Strongly regular Cayley graphs over the group \({\mathbb Z}_{p^n}\oplus {\mathbb Z}_{p^n}\), The Terwilliger algebra of a Hamming scheme \(H(d,q)\), Numerical invariants of strongly regular graphs, A Lloyd theorem in weakly metric association schemes, Improved Delsarte bounds for spherical codes in small dimensions, A note on the stability number of an orthogonality graph, Erdös–Ko–Rado Theorem—22 Years Later, Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3), On Rank and Kernel of ℤ4-Linear Codes, On the Kronecker Product Construction of Completely Transitive q-Ary Codes, THE LEE-SCHEME AND BOUNDS FOR LEE-CODES, Some Erdös–Ko–Rado Theorems for Chevalley Groups
