An Introduction to Association Schemes and Coding Theory

[1]  R. C. Bose,et al.  Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes , 1952 .

[2]  S. P. Lloyd Binary block coding , 1957 .

[3]  A. James,et al.  THE RELATIONSHIP ALGEBRA OF AN EXPERIMENTAL DESIGN , 1957 .

[4]  R. C. Bose,et al.  On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs , 1959 .

[5]  Morris Plotkin,et al.  Binary codes with specified minimum distance , 1960, IRE Trans. Inf. Theory.

[6]  Selmer M. Johnson A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[7]  J. Macwilliams A theorem on the distribution of weights in a systematic code , 1963 .

[8]  R. C. Bose Strongly regular graphs, partial geometries and partially balanced designs. , 1963 .

[9]  D. G. Higman Finite permutation groups of rank 3 , 1964 .

[10]  P. Eberlein,et al.  A two parameter test matrix , 1964 .

[11]  Richard C. Singleton,et al.  Maximum distance q -nary codes , 1964, IEEE Trans. Inf. Theory.

[12]  N. Hamada,et al.  Composition of some series of association algebras , 1965 .

[13]  D. G. Higman Intersection matrices for finite permutation groups , 1967 .

[14]  Donald G. Higman Characterization of families of rank 3 permutation groups by the subdegrees I , 1970 .

[15]  J. J. Seidel,et al.  Strongly Regular Graphs Derived from Combinatorial Designs , 1970, Canadian Journal of Mathematics.

[16]  Selmer M. Johnson On upper bounds for unrestricted binary-error-correcting codes , 1971, IEEE Trans. Inf. Theory.

[17]  Selmer M. Johnson,et al.  Upper bounds for constant weight error correcting codes , 1972, Discret. Math..

[18]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[19]  Neil J. A. Sloane,et al.  The MacWilliams identities for nonlinear codes , 1972 .

[20]  N. J. A. Sloane,et al.  A survey of constructive coding theory, and a table of binary codes of highest known rate , 1972, Discret. Math..

[21]  R. M. Damerell On Moore graphs , 1973, Mathematical Proceedings of the Cambridge Philosophical Society.

[22]  Philippe Delsarte,et al.  Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..

[23]  Hermann J. Helgert,et al.  Minimum-distance bounds for binary linear codes , 1973, IEEE Trans. Inf. Theory.

[24]  Elwyn R. Berlekamp,et al.  Goppa Codes , 2022 .

[25]  N. Biggs Perfect codes in graphs , 1973 .

[26]  C. Dunkl,et al.  Krawtchouk Polynomials and the Symmetrization of Hypergroups , 1974 .

[27]  J. M. Goethals Two dual families of nonlinear binary codes , 1974 .

[28]  J. Seidel Graphs and two-graphs , 1974 .

[29]  N. Biggs Combinatorics: Perfect codes and distance-transitive graphs , 1974 .

[30]  Robert J. McEliece,et al.  A low-rate improvement on the Elias bound (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[31]  Peter J. Cameron,et al.  Suborbits in Transitive Permutation Groups , 1975 .

[32]  J. H. van Lint Recent Results on Perfect Codes and Related Topics , 1975 .

[33]  Xavier L. Hubaut,et al.  Strongly regular graphs , 1975, Discret. Math..

[34]  Jean-Marie Goethals,et al.  Alternating Bilinear Forms over GF(q) , 1975, J. Comb. Theory A.

[35]  D. G. Higman Coherent configurations , 1975 .

[36]  P. Delsarte,et al.  The Association Schemes of Coding Theory , 1975 .

[37]  Philippe Delsarte,et al.  Properties and Applications of the Recurrence $F( {i + 1,k + 1,n + 1} ) = q^{k + 1} F( {i,k + 1,n} ) - q^k F( {i,k,n} )$ , 1976 .