Fetching the paper…
Reading the bibliography…
Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments.
R. C. Bose and K. R. Nair, Partially balanced incomplete block designs, Sankhyā 4 (1939) 337–372
1939
Earlier work this paper cites.
R. C. Bose and T. Shimamoto, Classification and analysis of partially balanced incomplete block designs with two associate classes, J. Amer. Statist. Assoc. 47 (1952) 151–184
1952
Earlier work this paper cites.
R. C. Bose and D. M. Mesner, On linear associative algebras corresponding to association schemes of partially balanced designs, Ann. Math. Statist. 30 (1959) 21–38
1959
Earlier work this paper cites.
P. Erdős, C. Ko and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 12 (1961) 313–320
1961
Earlier work this paper cites.
O. Tamaschke, Zur Theorie der Permutatationsgruppen mit regulärer Untergruppe I, Math. Z. 80 (1962/1963) 328–354
1963
Earlier work this paper cites.
H. Wielandt, Finite permutation groups, Academic Press, New York, 1964
1964
Earlier work this paper cites.
E. F. Assmus, Jr. and H. F. Mattson, Jr., New 5 5 -designs, J. Combin. Theory 6 (1969) 122–151
1969
Earlier work this paper cites.
F. J. MacWilliams, C. L. Mallows and N. J. A. Sloane, Generalizations of Gleason’s theorem on weight enumerators of self-dual codes, IEEE Trans. Inform. Theory IT-18 (1972) 794–805
1972
Earlier work this paper cites.
P. J. Cameron and J. J. Seidel, Quadratic forms over G F ( 2 ) GF(2) , Nederl. Akad. Wetensch. Proc. Ser. A 76=Indag. Math. 35 (1973) 1–8
1973
Earlier work this paper cites.
P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl. No. 10 (1973)
1973
Earlier work this paper cites.
P. Delsarte, J. M. Goethals and J. J. Seidel, Bounds for systems of lines and Jacobi polynomials, Philips Res. Rep. 30 (1975) 91–105
1975
Earlier work this paper cites.
P. Delsarte, Association schemes and t t -designs in regular semilattices, J. Combin. Theory Ser. A 20 (1976) 230–243
1976
Earlier work this paper cites.
C. F. Dunkl, A Krawtchouk polynomial addition theorem and wreath products of symmetric groups, Indiana Univ. Math. J. 25 (1976) 335–358
1976
Earlier work this paper cites.
P. Delsarte, Pairs of vectors in the space of an association scheme, Philips Res. Rep. 32 (1977) 373–411
1977
Earlier work this paper cites.
F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam, 1977
1977
Earlier work this paper cites.
R. J. McEliece, E. R. Rodemich, H. Rumsey, Jr. and L. R. Welch, New upper bounds on the rate of a code via the Delsarte–MacWilliams inequalities, IEEE Trans. Information Theory IT-23 (1977) 157–166
1977
Earlier work this paper cites.
P. Delsarte, Hahn polynomials, discrete harmonics, and t t -designs, SIAM J. Appl. Math. 34 (1978) 157–166
1978
Earlier work this paper cites.
P. Delsarte, Bilinear forms over a finite field, with applications to coding theory, J. Combin. Theory Ser. A 25 (1978) 226–241
1978
Earlier work this paper cites.
E. de Klerk and D. V. Pasechnik, A note on the stability number of an orthogonality graph, European J. Combin. 28 (2007) 1971–1979; arXiv: math/0505038
1979
Earlier work this paper cites.
L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25 (1979) 1–7
1979
Earlier work this paper cites.
A. Schrijver, A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory 25 (1979) 425–429
1979
Earlier work this paper cites.
D. A. Leonard, Orthogonal polynomials, duality and association schemes, SIAM J. Math. Anal. 13 (1982) 656–663
1982
Earlier work this paper cites.
E. Bannai and T. Ito, Algebraic combinatorics I: Association schemes, Benjamin/Cummings, Menlo Park, CA, 1984
1984
Earlier work this paper cites.
D. Stanton, Orthogonal polynomials and Chevalley groups, in: R. A. Askey, T. H. Koornwinder and W. Schempp (Eds.), Special functions: group theoretical aspects and applications, Reidel, Dordrecht, 1984, pp. 87–128
1984
Earlier work this paper cites.
R. M. Wilson, The exact bound in the Erdős–Ko–Rado theorem, Combinatorica 4 (1984) 247–257
1984
Earlier work this paper cites.
G. E. Andrews and R. Askey, Classical orthogonal polynomials, in: C. Brezinski, A. Draux, A. P. Magnus, P. Maroni and A. Ronveaux (Eds.), Polynômes orthogonaux et applications, Lecture Notes in Mathematics, vol. 1171, Springer-Verlag, Berlin, 1985, pp. 36–62
1985
Earlier work this paper cites.
D. Stanton, Harmonics on posets, J. Combin. Theory Ser. A 40 (1985) 136–149
1985
Earlier work this paper cites.
P. Frankl and R. M. Wilson, The Erdős–Ko–Rado theorem for vector spaces, J. Combin. Theory Ser. A 43 (1986) 228–236
1986
Earlier work this paper cites.
A. Munemasa, An analogue of t t -designs in the association schemes of alternating bilinear forms, Graphs Combin. 2 (1986) 259–267
1986
Earlier work this paper cites.
D. Stanton, t t -designs in classical association schemes, Graphs Combin. 2 (1986) 283–286
1986
Earlier work this paper cites.
T. Huang, An analogue of the Erdős–Ko–Rado theorem for the distance-regular graphs of bilinear forms, Discrete Math. 64 (1987) 191–198
1987
Earlier work this paper cites.
H. Niederreiter, Point sets and sequences with small discrepancy, Monatsh. Math. 104 (1987) 273–337
1987
Earlier work this paper cites.
H. Tarnanen, On extensions of association schemes, in: H. Laakso and A. Salomaa (Eds.), The very knowledge of coding, University of Turku, Turku, 1987, pp. 128–142
1987
Earlier work this paper cites.
M. Muzychuk, V V -rings of permutation groups with invariant metric, Ph.D. Thesis, Kiev State University, 1988
1988
Earlier work this paper cites.
A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-regular graphs, Springer-Verlag, Berlin, 1989
1989
Earlier work this paper cites.
V. F. R. Jones, On knot invariants related to some statistical mechanical models, Pacific J. Math. 137 (1989) 311–334
1989
Earlier work this paper cites.
E. Bannai, Character tables of commutative association schemes, in: W. M. Kantor, R. A. Liebler, S. E. Payne and E. E. Shult (Eds.), Finite geometries, buildings, and related topics, Oxford University Press, New York, 1990, pp. 105–128
1990
Earlier work this paper cites.
E. Bannai, S. Hao and S.-Y. Song, Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points, J. Combin. Theory Ser. A 54 (1990) 164–200
1990
Earlier work this paper cites.
E. Bannai, N. Kawanaka and S.-Y. Song, The character table of the Hecke algebra ℋ ( G L 2 n ( 𝔽 q ) , S p 2 n ( 𝔽 q ) ) \mathscr{H}(GL_{2n}(\mathbb{F}_{q}),Sp_{2n}(\mathbb{F}_{q})) , J. Algebra 129 (1990) 320–366
1990
Earlier work this paper cites.
C. W. Curtis and I. Reiner, Methods of representation theory I, John Wiley & Sons, New York, 1990
1990
Earlier work this paper cites.
E. Bannai, Subschemes of some association schemes, J. Algebra 144 (1991) 167–188
1991
Earlier work this paper cites.
A. R. Calderbank, P. Delsarte and N. J. A. Sloane, A strengthening of the Assmus–Mattson theorem, IEEE Trans. Inform. Theory 37 (1991) 1261–1268
1991
Earlier work this paper cites.
P. J. Cameron and J. H. van Lint, Designs, graphs, codes and their links, Cambridge University Press, Cambridge, 1991
1991
Earlier work this paper cites.
L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0 0 – 1 1 optimization, SIAM J. Optim. 1 (1991) 166–190
1991
Earlier work this paper cites.
A. Munemasa, Splitting fields of association schemes, J. Combin. Theory Ser. A 57 (1991) 157–161
1991
Earlier work this paper cites.
C. D. Godsil and A. D. Hensel, Distance regular covers of the complete graph, J. Combin. Theory Ser. B 56 (1992) 205–238
1992
Earlier work this paper cites.
P. Terwilliger, The subconstituent algebra of an association scheme I, J. Algebraic Combin. 1 (1992) 363–388
1992
Earlier work this paper cites.
E. Bannai, Association schemes and fusion algebras (an introduction), J. Algebraic Combin. 2 (1993) 327–344
1993
Earlier work this paper cites.
A. R. Calderbank and P. Delsarte, Extending the t t -design concept, Trans. Amer. Math. Soc. 338 (1993) 941–952
1993
Earlier work this paper cites.
C. D. Godsil, Algebraic combinatorics, Chapman & Hall, New York, 1993
1993
Earlier work this paper cites.
P. Terwilliger, The subconstituent algebra of an association scheme II, J. Algebraic Combin. 2 (1993) 73–103
1993
Earlier work this paper cites.
P. Terwilliger, The subconstituent algebra of an association scheme III, J. Algebraic Combin. (1993) 177–210
1993
Earlier work this paper cites.
E. Bannai and E. Bannai, Generalized generalized spin models (four-weight spin models), Pacific J. Math. 170 (1995) 1–16
1995
Earlier work this paper cites.
D. G. Higman, Strongly regular designs of the second kind, European J. Combin. 16 (1995) 479–490
1995
Cited alongside, same era.
I. G. Macdonald, Symmetric functions and Hall polynomials (Second edition), Oxford University Press, New York, 1995
1995
Cited alongside, same era.
N. J. A. Sloane and J. Stufken, A linear programming bound for orthogonal arrays with mixed levels, J. Statist. Plann. Inference 56 (1996) 295–305
1996
Cited alongside, same era.
E. Bannai, E. Bannai and F. Jaeger, On spin models, modular invariance, and duality, J. Algebraic Combin. 6 (1997) 203–228
1997
Cited alongside, same era.
A. R. Calderbank, P. J. Cameron, W. M. Kantor and J. J. Seidel, ℤ 4 \mathbb{Z}_{4} -Kerdock codes, orthogonal spreads, and extremal Euclidean line-sets, Proc. London Math. Soc. 75 (1997) 436–480
1997
Cited alongside, same era.
A. Chan and C. Godsil, Bose–Mesner algebras attached to invertible Jones pairs, J. Combin. Theory Ser. A 106 (2004) 165–191; arXiv: math/0303370
2004
Later among the works it cites.
W. Chu, C. J. Colbourn and P. Dukes, Constructions for permutation codes in powerline communications, Des. Codes Cryptogr. 32 (2004) 51–64
2004
Later among the works it cites.
P. Delsarte, Beyond the orthogonal array concept, European J. Combin. 25 (2004) 187–198
2004
Later among the works it cites.
T. Fujisaki, A construction of amorphous association scheme from a pseudo-cyclic association scheme, Discrete Math. 285 (2004) 307–311
2004
Later among the works it cites.
T. Ito, Designs in a coset geometry: Delsarte theory revisited, European J. Combin. 25 (2004) 229–238
2004
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. I. Levenshtein, Split orthogonal arrays and maximum independent resilient systems of functions, Des. Codes Cryptogr. 12 (1997) 131–160
1997
Cited alongside, same era.
M. Y. Rosenbloom and M. A. Tsfasman, Codes for the m m -metric, Problems Inform. Transmission 33 (1997) 45–52
1997
Cited alongside, same era.
K. Tanabe, The irreducible modules of the Terwilliger algebras of Doob schemes, J. Algebraic Combin. 6 (1997) 173–195
1997
Cited alongside, same era.
P. Camion, Codes and association schemes: basic properties of association schemes relevant to coding, in: V. S. Pless, W. C. Huffman and R. A. Brualdi (Eds.), Handbook of coding theory, Vol. I, II, North-Holland, Amsterdam, 1998, pp. 1441–1566
1998
Cited alongside, same era.
P. Delsarte and V. I. Levenshtein, Association schemes and coding theory, IEEE Trans. Inform. Theory 44 (1998) 2477–2504
1998
Cited alongside, same era.
F. Jaeger, M. Matsumoto and K. Nomura, Bose–Mesner algebras related to type II matrices and spin models, J. Algebraic Combin. 8 (1998) 39–72
1998
Cited alongside, same era.
R. Koekoek and R. F. Swarttouw, The Askey scheme of hypergeometric orthogonal polynomials and its q q -analog, report 98-17, Delft University of Technology, The Netherlands, 1998. Available at http://aw.twi.tudelft.nl/˜koekoek/askey.html
1998
Cited alongside, same era.
J. H. Koolen and V. Moulton, There are finitely many triangle-free distance-regular graphs with degree 8 8 , 9 9 or 10 10 , J. Algebraic Combin. 19 (2004) 205–217
2004
Later among the works it cites.
W. J. Martin, Completely regular codes: a viewpoint and some problems, in: Proceedings of Com 2 MaC workshop on distance-regular graphs and finite geometry, July 2004, Pusan, Korea, pp. 43–56
2004
Later among the works it cites.
H. Mizukawa, Zonal spherical functions on the complex reflection groups and ( n + 1 , m + 1 ) (n+1,m+1) -hypergeometric functions, Adv. Math. 184 (2004) 1–17
2004
Later among the works it cites.
H. Mizukawa and H. Tanaka, ( n + 1 , m + 1 ) (n+1,m+1) -hypergeometric functions associated to character algebras, Proc. Amer. Math. Soc. 132 (2004) 2613–2618
2004
Later among the works it cites.
P. Terwilliger, Leonard pairs and the q q -Racah polynomials, Linear Algebra Appl. 387 (2004) 235–276; arXiv: math/0306301
2004
Later among the works it cites.
J. S. Caughman, IV and N. Wolff, The Terwilliger algebra of a distance-regular graph that supports a spin model, J. Algebraic Combin. 21 (2005) 289–310
2005
Later among the works it cites.
E. R. van Dam and J. H. Koolen, A new family of distance-regular graphs with unbounded diameter, Invent. Math. 162 (2005) 189–193
2005
Later among the works it cites.
T. Gannon, Modular data: the algebraic combinatorics of conformal field theory, J. Algebraic Combin. 22 (2005) 211–250; arXiv: math/0103044
2005
Later among the works it cites.
D. Gijswijt, Matrix algebras and semidefinite programming techniques for codes, Ph.D. Thesis, The Universiteit van Amsterdam, 2005
2005
Later among the works it cites.
W.-C. W. Li and and Y. Meemark, Ramanujan graphs on cosets of P G L 2 ( 𝔽 q ) PGL_{2}(\mathbb{F}_{q}) , Finite Fields Appl. 11 (2005) 511–543; arXiv: math/0502250
2005
Later among the works it cites.
A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (2005) 2859–2866
2005
Later among the works it cites.
H. Suzuki, The Terwilliger algebra associated with a set of vertices in a distance-regular graph, J. Algebraic Combin. 22 (2005) 5–38
2005
Later among the works it cites.
P. Terwilliger, The displacement and split decompositions for a Q Q -polynomial distance-regular graph, Graphs Combin. 21 (2005) 263–276; arXiv: math/0306142
2005
Later among the works it cites.
P.-H. Zieschang, Theory of association schemes, Springer-Verlag, Berlin, 2005
2005
Later among the works it cites.
E. Bannai and E. Bannai, On primitive symmetric association schemes with m 1 = 3 m_{1}=3 , Contrib. Discrete Math. 1 (2006) 68–79
2006
Later among the works it cites.
D. Gijswijt, A. Schrijver and H. Tanaka, New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming, J. Combin. Theory Ser. A 113 (2006) 1719–1731
2006
Later among the works it cites.
H. D. L. Hollmann and Q. Xiang, Association schemes from the action of P G L ( 2 , q ) PGL(2,q) fixing a nonsingular conic in P G ( 2 , q ) PG(2,q) , J. Algebraic Combin. 24 (2006) 157–193; arXiv: math/0503573
2006
Later among the works it cites.
W. J. Martin and B. E. Sagan, A new notion of transitivity for groups and sets of permutations, J. London Math. Soc. 73 (2006) 1–13; arXiv: math/0206163
2006
Later among the works it cites.
O. R. Musin, The kissing problem in three dimensions, Discrete Comput. Geom. 35 (2006) 375–384; arXiv: math/0410324
2006
Later among the works it cites.
2006
Later among the works it cites.
H. Tanaka, Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs, J. Combin. Theory Ser. A 113 (2006) 903–910
2006
Later among the works it cites.
P. Terwilliger, An algebraic approach to the Askey scheme of orthogonal polynomials, in: F. Marcellán and W. Van Assche (Eds.), Orthogonal polynomials and special functions, Computation and applications, Lecture Notes in Mathematics, vol. 1883, Springer-Verlag, Berlin, 2006, pp. 255–330; arXiv: math/0408390
2006
Later among the works it cites.
J. Bierbrauer, A direct approach to linear programming bounds for codes and tms-nets, Des. Codes Cryptogr. 42 (2007) 127–143
2007
Later among the works it cites.
B. Curtin, Spin Leonard pairs, Ramanujan J. 13 (2007) 319–332
2007
Later among the works it cites.
M. DeDeo, D. Lanphier and M. Minei, The spectrum of Platonic graphs over finite fields, Discrete Math. 307 (2007) 1074–1081
2007
Later among the works it cites.
J. H. Dinitz, Room squares, in: C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of combinatorial designs (Second edition), Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 584–590
2007
Later among the works it cites.
R. Hosoya and H. Suzuki, Tight distance-regular graphs with respect to subsets, European J. Combin. 28 (2007) 61–74
2007
Later among the works it cites.
T. Ito and P. Terwilliger, The q q -tetrahedron algebra and its finite dimensional irreducible modules, Comm. Algebra 35 (2007) 3415–3439; arXiv: math/0602199
2007
Later among the works it cites.
G. B. Khosrovshahi and R. Laue, t t -Designs with t ⩾ 3 t\geqslant 3 , in: C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of combinatorial designs (Second edition), Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 79–101
2007
Later among the works it cites.
M. Laurent, Strengthened semidefinite programming bounds for codes, Math. Program. 109 (2007) Ser. B 239–261
2007
Later among the works it cites.
W. J. Martin, ( t , m , s ) (t,m,s) -Nets, in: C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of combinatorial designs (Second edition), Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 639–643
2007
Later among the works it cites.
W. J. Martin, M. Muzychuk and J. Williford, Imprimitive cometric association schemes: constructions and analysis, J. Algebraic Combin. 25 (2007) 399–415
2007
Later among the works it cites.
W. J. Martin and T. I. Visentin, A dual Plotkin bound for ( T , M , S ) (T,M,S) -nets, IEEE Trans. Inform. Theory 53 (2007) 411–415
2007
Later among the works it cites.
B. Mounits, T. Etzion and S. Litsyn, New upper bounds on codes via association schemes and linear programming, Adv. Math. Commun. 1 (2007) 173–195
2007
Later among the works it cites.
A. Munemasa, Spherical designs, in: C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of combinatorial designs (Second edition), Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 617–622
2007
Later among the works it cites.
C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, J. Amer. Math. Soc. 21 (2008) 909–924; arXiv: math/0608426
2008
Closest in time.
T. Ceccherini-Silberstein, F. Scarabotti and F. Tolli, Harmonic analysis on finite groups, Cambridge University Press, Cambridge, 2008
2008
Closest in time.
P. Diaconis and I. M. Isaacs, Supercharacters and superclasses for algebra groups, Trans. Amer. Math. Soc. 360 (2008) 2359–2392
2008
Closest in time.
C. D. Godsil and M. W. Newman, Coloring an orthogonality graph, SIAM J. Discrete Math. 22 (2008) 683–692; arXiv: math/0509151
2008
Closest in time.
D. Grant and M. K. Varanasi, Duality theory for space-time codes over finite fields, Adv. Math. Commun. 2 (2008) 35–54
2008
Closest in time.
T. Komatsu, Tamely ramified Eisenstein fields with prime power discriminants, Kyushu J. Math. 62 (2008) 1–13
2008
Closest in time.
N. LeCompte, W. J. Martin and W. Owens, On the equivalence between real mutually unbiased bases and a certain class of association schemes, preprint, August 2008
2008
Closest in time.
M. S. MacLean and P. Terwilliger, The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two, Discrete Math. 308 (2008) 1230–1259; arXiv: math/0604351
2008
Closest in time.
O. R. Musin, The kissing number in four dimensions, Ann. of Math. (2) 168 (2008) 1–32; arXiv: math/0309430
2008
Closest in time.
2008
Closest in time.
2009
Closest in time.
S. Bang, J. H. Koolen and V. Moulton, Two theorems concerning the Bannai–Ito conjecture, European J. Combin. 28 (2007) 2026–2052
2052
Closest in time.