scientific article; zbMATH DE number 2232233
From MaRDI portal
Publication:5707657
zbMath1075.05606MaRDI QIDQ5707657
Publication date: 24 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The homogeneous weight partition and its character-theoretic dual, \(\mathbb{Z}_4\mathbb{Z}_4 [u\)-additive cyclic and constacyclic codes], Entry-faithful 2-neighbour transitive codes, Pairs of quadratic forms over finite fields, On Mitchell's embedding theorem for a quasi-schemoid, Asymptotic Delsarte cliques in distance-regular graphs, Some bounds for the number of blocks. III., Rank-metric codes and their duality theory, \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality, 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, Total perfect codes in Cayley graphs, 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, Nonexistence results for tight block designs, 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, Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets, Character tables of association schemes based on attenuated spaces, On distance-regular graphs with smallest eigenvalue at least \(- m\), Fourier analysis, linear programming, and densities of distance avoiding sets in \(\mathbb R^n\), Intriguing sets of vertices of regular graphs, A simple combinatorial treatment of constructions and threshold gaps of ramp schemes, On the existence of tight relative 2-designs on binary Hamming association schemes, Quantum weakly nondeterministic communication complexity, 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, New inequalities for \(q\)-ary constant-weight codes, New families of \(Q\)-polynomial association schemes, Some remarks on Euclidean tight designs, On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes, The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\), A spectral equivalent condition of the \(P\)-polynomial property for association schemes, Spectral approach to linear programming bounds on codes, Code spectrum and the reliability function: binary symmetric channel, Krawtchouk polynomials, the Lie algebra \(\mathfrak{sl}_2\), and Leonard pairs, Maximum distance separable codes over \({\mathbb{Z}_4}\) and \({\mathbb{Z}_2 \times \mathbb{Z}_4}\), Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist, The triple distribution of codes and ordered codes, A Higman inequality for regular near polygons, New parameters of subsets in polynomial association schemes, On weight distributions of perfect colorings and completely regular codes, Bounds on three- and higher-distance sets, Spectral bounds for the independence ratio and the chromatic number of an operator, On cliques in edge-regular graphs, Generalizing Krawtchouk polynomials using Hadamard matrices, Modular adjacency algebras of Grassmann graphs, There are only finitely many distance-regular graphs of fixed valency greater than two, Partitions of Frobenius rings induced by the homogeneous weight, MacWilliams extension theorems and the local-global property for codes over Frobenius rings, Difference sets and positive exponential sums. I: General properties, Characterizations of regularity for certain \(Q\)-polynomial association schemes, Wreath product action on generalized Boolean algebras, A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes, Symmetric bilinear forms over finite fields with applications to coding theory, Uniform eventown problems, On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra, Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs, Orthogonal partitions in designed experiments, Spreads in strongly regular graphs, Energy bounds for codes and designs in Hamming spaces, On some classes of linear codes over \(\mathbb{Z}_2\mathbb{Z}_4\) and their covering radii, \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays, On \(Q\)-polynomial regular near \(2d\)-gons, The subconstituent algebra of an association scheme. I, New non-existence proofs for ovoids of Hermitian polar spaces and hyperbolic quadrics, Ball packings with high chromatic numbers from strongly regular graphs, Completely regular codes with different parameters giving the same distance-regular coset graphs, On spherical designs of some harmonic indices, A tribute to Dennis Stanton, On structures of modular adjacency algebras of Johnson schemes, Cubic and higher degree bounds for codes and \((t,m,s)\)-nets, A strong log-concavity property for measures on Boolean algebras, Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices, Zeros of generalized Krawtchouk polynomials, Conway groupoids and completely transitive codes, Universal lower bounds for potential energy of spherical codes, Invitation to intersection problems for finite sets, 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\), On a conjecture of Brouwer involving the connectivity of strongly regular graphs, Subgroup perfect codes in Cayley sum graphs, 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, One weight \(\mathbb {Z}_2\mathbb {Z}_4\) additive codes, Optimal tristance anticodes in certain graphs, Some colouring problems for Paley graphs, Tamaschke's results on Schur rings and a generalization of association schemes, A survey of partial difference sets, \(\mathbb{Z}_{2}\mathbb{Z}_{2}\mathbb{Z}_{4}\)-additive cyclic codes, Cyclotomic graphs and perfect codes, Boolean degree 1 functions on some classical association schemes, On splitting the Clebsch graph, 5-designs with three intersection numbers, Quotients of association schemes, Minimum supports of eigenfunctions of Johnson graphs, On eigenfunctions and maximal cliques of Paley graphs of square order, Class 3 association schemes whose symmetrizations have two classes, Upper bounds for \(s\)-distance sets and equiangular lines, Applications of coding theory to the construction of modular lattices, Quasi-symmetric designs and codes meeting the Grey-Rankin bound, Hermitian rank distance codes, \(LCD\) codes from adjacency matrices of graphs, 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)\), A semidefinite programming approach to a cross-intersection problem with measures, Ideal ramp schemes and related combinatorial objects, Width and dual width of subsets in polynomial association schemes, Distances, graphs and designs, A valency bound for distance-regular graphs, On the connectivity of graphs in association schemes, Polar spaces, generalized hexagons and perfect codes, Strongly regular graphs having strongly regular subconstituents, Cube group invariant spherical harmonics and Krawtchouk polynomials, An upper bound on the sum of squares of degrees in a hypergraph, The family of t-designs. Part I, Harmonic index designs in binary Hamming schemes, The classification of antipodal two-weight linear codes, Nonexistence of certain pseudogeometric graphs, How many P-polynomial structures can an association scheme have?, A new class of optimal linear codes with flexible parameters, On the weight distribution of spherical t-designs, 1-homogeneous graphs with cocktail party \({\mu}\)-graphs, Codes from adjacency matrices of uniform subset graphs, 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, Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields, A new characterization of the dual polar graphs, Characterization of the odd graphs \(O_ k \)by parameters, Beyond the orthogonal array concept., Designs in a coset geometry: Delsarte theory revisited., 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, Tight 2-designs and perfect 1-codes in Doob graphs, 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, Problems on discrete metric spaces, Erdős-Ko-Rado-type results over \(J_q(n,d),H_q(n,d)\) and their designs, On designs in compact metric spaces and a universal bound on their size, On balanced orthogonal multi-arrays: Existence, construction and application to design of experiments, Association schemes of small order, A family of partial difference sets with Denniston parameters in nonelementary abelian 2-groups, 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, Codes and anticodes in the Grassman graph, 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, On the non-existence of extended 1-perfect codes and MDS codes, Erdős-Ko-Rado theorems for ovoidal circle geometries and polynomials over finite fields, Anticodes in the sum-rank metric, \(Q\)-polynomial coherent configurations, On a correspondence between maximal cliques in Paley graphs of square order, Algebras, graphs and thetas, Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations, Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\), Subset representations and eigenvalues of the universal intertwining matrix, \(\mathbb{F}_qR\)-linear skew cyclic codes, 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, \(k\)-point semidefinite programming bounds for equiangular lines, Special sets of lines in PG(3,2), Completely regular codes in Johnson and Grassmann graphs with small covering radii, Explicit construction of exact unitary designs, On product of association schemes and Shannon capacity, On the existence of saturated and nearly saturated asymmetrical orthogonal arrays, A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs, A classification of the strongly regular generalised Johnson graphs, Symmetric bilinear forms over finite fields of even characteristic, Local distributions for eigenfunctions and perfect colorings of \(q\)-ary Hamming graph, Strengthening the Gilbert-Varshamov bound, The chromatic number of the \(q\)-Kneser graph for large \(q\), On covering radii and coset weight distributions of extremal binary self-dual codes of length 40, Codes, cubes, and graphical designs, New nonbinary code bounds based on divisibility arguments, Idempotent systems and character algebras, A characterization of Johnson and Hamming graphs and proof of Babai's conjecture, Optimal line packings from nonabelian groups, An Assmus-Mattson theorem for codes over commutative association schemes, Nonexistence of nontrivial tight 8-designs, Stability for 1-intersecting families of perfect matchings, On the clique number of a strongly regular graph, On two-weight \(\mathbb {Z}_{2^k}\)-codes, Diameter bounds and recursive properties of Full-Flag Johnson graphs, A new approach for examining \(q\)-Steiner systems, Uniqueness of codes using semidefinite programming, Relative \(t\)-designs in Johnson association schemes for P-polynomial structure, On the isomorphism of certain primitive \(Q\)-polynomial not \(P\)-polynomial association schemes, On the variance of average distance of subsets in the Hamming space, Addressing graph products and distance-regular graphs, Spectral bounds and distance-regularity, Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras, On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes, Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry, Completely regular codes by concatenating Hamming codes, Pseudo-ovals of elliptic quadrics as Delsarte designs of association schemes, Idempotent systems, 3-setwise intersecting families of the symmetric group, On a metric property of perfect colorings, On the spectral gap and the automorphism group of distance-regular graphs, The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters, \(s\)-elusive codes in Hamming graphs, Heden's bound on the tail of a vector space partition, Improved linear programming bound on sizes of doubly constant-weight codes, 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, Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs, An upper bound for the size of \(s\)-distance sets in real algebraic sets, A Cauchy-Khinchin matrix inequality, Non-existence and construction of pre-difference sets, and equi-distributed subsets in association schemes, Antipodal sets and designs on unitary groups, Geometric designs and rotatable designs. I, Designs in finite metric spaces: a probabilistic approach, Notes on the Leonard system classification, Relative \(t\)-designs in nonbinary Hamming association schemes, 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 regular systems of finite classical polar spaces, On schematic orthogonal arrays \(OA(q^ t,k,q,t)\), Optimization of eigenvalue bounds for the independence and chromatic number of graph powers, Characterization of \(p\)-ary functions in terms of association schemes and its applications, On perfect and Reed-Muller codes over finite fields, Allgemeine Schnittzahlen in t-Designs. (General intersection numbers in t-designs), Perfect codes in Cayley sum graphs, Book review of: E. Bannai et al., Algebraic combinatorics, Book review of: H.-H. Wu, Understanding numbers in elementary school mathematics, On the classification of binary completely transitive codes with almost-simple top-group, 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, Imprimitive symmetric association schemes of classes 5 and 6 arising from ternary non-weakly regular bent functions, The packing problem for projective geometries over GF(3) with dimension greater than five, Perfect codes in the graphs \(O_k\), Bounds for regular induced subgraphs of strongly regular graphs, Dual bounds for the positive definite functions approach to mutually unbiased bases, On cryptographic propagation criteria for Boolean functions, On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images, Spectrum of Johnson graphs, On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances, Homogeneous coherent configurations from spherical buildings and other edge-coloured graphs, 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, Geometric representations of \(\text{GL}(n,R)\), cellular Hecke algebras and the embedding problem., Inequalities for quasisymmetric designs, Geometric invariants for quasi-symmetric designs, A characterization of \(P\)- and \(Q\)-polynomial association schemes, Strengthened semidefinite programming bounds for codes, 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 Delsarte's linear programming bound as a ratio bound, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, A characterization of t-designs in terms of the inner distribution, Feasibility conditions for non-symmetric 3-class association schemes, Imprimitive cometric association schemes: constructions and analysis, Algebraic theory of block codes detecting independent errors, Classification of graphs by regularity, Modular adjacency algebras of dual polar schemes, Ordered partitions and codes generated by circulant matrices, The Erdős-Ko-Rado property for some 2-transitive groups, Weighing matrices and spherical codes, Quotient-polynomial graphs, Linear programming bounds for regular graphs, The Cameron-Liebler problem for sets, Double covers of symplectic dual polar graphs, Tight relative 2-designs on two shells in Johnson association schemes, A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4, On relative \(t\)-designs in polynomial association schemes, 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, Difference set constructions of DRADs and association schemes, New explicit bounds for ordered codes and \((t,m,s)\)-nets, Some implications on amorphic association schemes, Permutation codes, \(Z_2Z_4\)-linear codes: rank and kernel, On the equivalence between real mutually unbiased bases and a certain class of association schemes, Pseudocyclic association schemes and strongly regular graphs, Distance-regular graphs with light tails, 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, On Boolean functions with the sum of every two of them being bent, Some results on skew Hadamard difference sets, On tight projective designs, On set systems with restricted intersections modulo \(p\) and \(p\)-ary \(t\)-designs, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps, New examples of Euclidean tight 4-designs, There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three, New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra, Linear programming bounds for codes via a covering argument, Lower bounds for projective designs, cubature formulas and related isometric embeddings, On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs, The mathematics of Donald Gordon Higman, Bounds on subsets of coherent configurations, Unitary designs and codes, A survey on spherical designs and algebraic combinatorics on spheres, Representations of finite association schemes, Commutative association schemes, Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs, On a class of binary linear completely transitive codes with arbitrary covering radius, Lower bounds for measurable chromatic numbers, 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, Design theory from the viewpoint of algebraic combinatorics, Light tails and the Hermitian dual polar graphs, Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\), Semidefinite bounds for nonbinary codes based on quadruples, 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, Optimal measures for \(p\)-frame energies on spheres, On the number of \(q\)-ary quasi-perfect codes with covering radius 2, On the coset graph construction of distance-regular graphs, Neumaier graphs with few eigenvalues, Grassmann graphs, degenerate DAHA, and non-symmetric dual \(q\)-Hahn polynomials, Diameter bounds for geometric distance-regular graphs, On Bonisoli's theorem and the block codes of Steiner triple systems, Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities, The smallest strictly Neumaier graph and its generalisations, On \(q\)-ary codes with two distances \(d\) and \(d+1\), On distance distributions of orthogonal arrays, \(t\)-resilient functions and the partial exposure problem, Spectral analysis of non-Hermitian matrices and directed graphs, A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number, Equitable 2-partitions of the Hamming graphs with the second eigenvalue, On the algebraic combinatorics of injections, Association schemes arising from bent functions, Contact graphs of ball packings, Hamming graphs in Nomura algebras, Bounds on sets with few distances, One-weight and two-weight \(\mathbb{Z}_2\mathbb{Z}_2[u,v\)-additive codes], Linear programming bounds for balanced arrays, Geometric aspects of 2-walk-regular graphs, \(Q\)-polynomial distance-regular graphs and a double affine Hecke algebra of rank one, New families of completely regular codes and their corresponding distance regular coset graphs, Smith normal forms of incidence matrices, On the theta number of powers of cycle graphs, New and updated semidefinite programming bounds for subspace codes, A new proof for the Erdős-Ko-Rado theorem for the alternating group, Tight relative 2- and 4-designs on binary Hamming association schemes, Integer invariants of abelian Cayley graphs, Nonassociativity of the Norton algebras of some distance regular graphs, On tight 4-designs in Hamming association schemes, The Erdős-Ko-Rado theorem for twisted Grassmann graphs, Semidefinite programming for permutation codes, Improved upper bounds for parent-identifying set systems and separable codes, On subgroup perfect codes in Cayley graphs, Tightness in subset bounds for coherent configurations, Algebraic properties of perfect structures, On perfect colorings of infinite multipath graphs, On Rosenbloom and Tsfasman's generalization of the Hamming space, Weakly Hadamard diagonalizable graphs, The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations, 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], \(\mathbb Z_2\mathbb Z_4\)-additive formally self-dual codes, Sporadic neighbour-transitive codes in Johnson graphs, Kravchuk polynomials and induced/reduced operators on Clifford algebras, On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length, Bounds for codes and designs in complex subspaces, Bounds on permutation codes of distance four, Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, Dual distances of completely regular codes, Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces, On components of the Kerdock codes and the dual of the BCH code \(C_{1, 3}\), Neighbour-transitive codes in Johnson graphs, Remarks on the concepts of \(t\)-designs, On completely regular and completely transitive supplementary codes, On the integrability of strongly regular graphs, Geometric antipodal distance-regular graphs with a given smallest eigenvalue, Perfect 2-colorings of the Grassmann graph of planes, 2-neighbour-transitive codes with small blocks of imprimitivity, Quadratic and symmetric bilinear forms over finite fields and their association schemes, Minimal binary 2-neighbour-transitive codes, New code upper bounds for the folded \(n\)-cube, Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes, Mehler-Heine type formulas for the Krawtchouk polynomials, Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg}, On reconstruction of eigenfunctions of Johnson graphs, Distance-regular graphs without 4-claws, Semidefinite programming bounds for Lee codes, The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time, Perfect 3-colorings on 6-regular graphs of order 9, The theta number of simplicial complexes, Energy bounds for codes in polynomial metric spaces, Cameron-Liebler sets of generators in finite classical polar spaces, A new distance-regular graph of diameter 3 on 1024 vertices, MacDonald codes over the ring \(\mathbb{F}_p + v\mathbb{F}_p + v^2\mathbb{F}_p\), Regular intersecting families, Perfect codes in the discrete simplex, Spherical designs of harmonic index \(t\), Fourier-reflexive partitions and MacWilliams identities for additive codes, Families of nested completely regular codes and distance-regular graphs, On the ideal of the shortest vectors in the Leech lattice and other lattices, Perfect state transfer on distance-regular graphs and association schemes, Semidefinite programming and eigenvalue bounds for the graph partition problem, Association schemoids and their categories, The density of sets avoiding distance 1 in Euclidean space, Association schemes on general measure spaces and zero-dimensional abelian groups, On completely regular codes with minimum eigenvalue in geometric graphs, Bounds for sets with few distances distinct modulo a prime ideal, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, Gray images of cyclic codes over \(\mathbb{Z}_{p^2}\) and \(\mathbb{Z}_p \mathbb{Z}_{p^2}\), Schematic 4-designs, Characterizing subgroup perfect codes by 2-subgroups, One more proof of the first linear programming bound for binary codes and two conjectures, \(K_4\)-intersecting families of graphs, Quantum walks on simplexes and multiple perfect state transfer, The algebraic structure of additive codes over 𝔽2𝔽8, Spherical designs and modular forms of the \(D_4\) lattice, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, Approximately counting independent sets in bipartite graphs via graph containers, Large cycles in generalized Johnson graphs, Schematic saturated orthogonal arrays obtained by using the expansive replacement method, Optimal and extremal graphical designs on regular graphs associated with classical parameters, A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\), On the 430-cap of \(\mathrm{PG}(6,4)\) having two intersection sizes with respect to hyperplanes, On the classification of completely regular codes with covering radius two and antipodal duals, A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\), On Integrality in Semidefinite Programming for Discrete Optimization, Synchronising primitive groups of diagonal type exist, A family of diameter perfect constant-weight codes from Steiner systems, A bivariate \(Q\)-polynomial structure for the non-binary Johnson scheme, On the automorphism groups of rank-4 primitive coherent configurations, Quantum isomorphism of graphs from association schemes, Uniqueness of an association scheme related to the Witt design on 11 points, Constructions and invariants of optimal codes in the Lee metric, An extension of the Erdős-Ko-Rado theorem to uniform set partitions, On a class of skew constacyclic codes over mixed alphabets and applications in constructing optimal and quantum codes, Graphical designs and gale duality, ℤ₂ℤ₄-additive codes as codes over rings, Embedding bipartite distance graphs under Hamming metric in finite fields, On the weight distribution of the cosets of MDS codes, On one-Lee weight and two-Lee weight \(\mathbb{Z}_2\mathbb{Z}_4[u\) additive codes and their constructions], Hadamard matrices related to projective planes, Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022, Separating rank 3 graphs, Approximation of integration over finite groups, difference sets and association schemes, Partitions into perfect codes in the Hamming and Lee metrics, Lower bound on the minimum number of edges in subgraphs of Johnson graphs, Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes, Averaging over codes and an SU(2) modular bootstrap, Inclusion matrices for rainbow subsets, Perfect 2‐colorings of Hamming graphs, A census of small Schurian association schemes, Wreath products and projective system of non-Schurian association schemes, Near-bipartite Leonard pairs, New eigenvalue bound for the fractional chromatic number, Neighbour-transitive codes in Kneser graphs, On completely regular codes, Unnamed Item, On the optimum of Delsarte's linear program, Generalized Krawtchouk polynomials and the composition scheme, Some Erdös–Ko–Rado Theorems for Chevalley Groups, Packings and Steiner systems in polar spaces, Intersection Matrices Revisited, MMS-type problems for Johnson scheme, Estimates of the distance distribution of codes and designs, Lifting constructions of strongly regular Cayley graphs, On the Automorphism Groups of the $$\mathbb{Z}_{2}\mathbb{Z}_{4}$$ -Linear Hadamard Codes and Their Classification, Reconstruction of Eigenfunctions of q-ary n-Dimensional Hypercube, Numerical invariants of strongly regular graphs, (𝑛+1,𝑚+1)-hypergeometric functions associated to character algebras, 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, A polynomial ideal associated to any $t$-$(v,k,\lambda)$ design, A Taxonomy of Perfect Domination, Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, Maximum distance separable codes over ℤ2 × ℤ2s, Hoffman's ratio bound, Compatibility and companions for Leonard pairs, On two-weight codes, The Maximum k-Colorable Subgraph Problem and Related Problems, Additive \(G\)-codes over \(\mathbb{F}_q\) and their dualities, Alphabet-almost-simple 2-neighbour-transitive codes, Neighbour-transitive codes and partial spreads in generalised quadrangles, Fusions of the generalized Hamming scheme on a strongly-regular graph, Continuous-time quantum walks on Cayley graphs of extraspecial groups, Constructing few-weight linear codes and strongly regular graphs, The Minimum Distance of Some Narrow-Sense Primitive BCH Codes, Quasi-unbiased Hadamard matrices and weakly unbiased Hadamard matrices: A coding-theoretic approach, A family of balanced generalized weighing matrices, Unnamed Item, Closures of finite permutation groups, \(\mathbb{F}_qR\)-linear skew constacyclic codes and their application of constructing quantum codes, A Family of Partial Geometric Designs from Three-Class Association Schemes, A new construction of strongly regular graphs with parameters of the complement symplectic graph, Optimal Narain CFTs from codes, On non-normal subgroup perfect codes, The covering radius of permutation designs, Unnamed Item, A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES, A short solution of the kissing number problem in dimension three, Formally self-dual LCD codes from two-class association schemes, Unnamed Item, Perfect Codes in Cayley Graphs, Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry, On symmetric association schemes and associated quotient-polynomial graphs, High dimensional Hoffman bound and applications in extremal combinatorics, An analogue of Vosper's theorem for extension fields, Asymptotic joint spectra of Cartesian powers of strongly regular graphs and bivariate Charlier–Hermite polynomials, Hypercontractivity of Spherical Averages in Hamming Space, Subgroup Perfect Codes in Cayley Graphs, Some Restrictions on Weight Enumerators of Singly Even Self-Dual Codes II, Homomorphisms of strongly regular graphs, 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, Quaternary Plotkin Constructions and Quaternary Reed-Muller Codes, Conway’s groupoid and its relatives, Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays, Preface, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs, On few-class Q-polynomial association schemes: feasible parameters and nonexistence results, A cross-intersection theorem for vector spaces based on semidefinite programming, On perfect binary codes, The covering radius of doubled 2-designs in \(2O_ k\), Complex Spherical Designs and Codes, New upper bounds for kissing numbers from semidefinite programming, An application of information theory and error-correcting codes to fractional factorial experiments, On tight spherical designs, What is known about unit cubes, Spin models and strongly hyper-self-dual Bose-Mesner algebras, Erdös–Ko–Rado Theorem—22 Years Later, Finite Rings with Applications, Negative correlation and log-concavity, TD-pairs and the $q$-Onsager algebra, Discrete Serrin's problem, Invariant Semidefinite Programs, The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space, Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\), Harmonic index \(t\)-designs in the Hamming scheme for arbitrary \(q\), Circulant association schemes on triples, Domination and Spectral Graph Theory, Kravchuk matrices and induced operators on Clifford algebras, Unnamed Item, Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations, Unnamed Item, Another View of the Division Property, Unnamed Item, THE LEE-SCHEME AND BOUNDS FOR LEE-CODES, Unnamed Item, 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)\), Rank-Metric Codes and Their Applications, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph, A Scientific Tour on Orthogonal Arrays, On the explicit constructions of certain unitaryt-designs, A general method to obtain the spectrum and local spectra of a graph from its regular partitions
